225 research outputs found
Axiomatizing propositional dependence logics
We give sound and complete Hilbert-style axiomatizations for propositional dependence logic (PD), modal dependence logic (MDL), and extended modal dependence logic (EMDL) by extending existing axiomatizations for propositional logic and modal logic. In addition, we give novel labeled tableau calculi for PD, MDL, and EMDL. We prove soundness, completeness and termination for each of the labeled calculi
Axiomatization of a Basic Logic of Logical Bilattices
A sequential axiomatization is given for the 16-valued logic that has been proposed by Shramko-Wansing (J Philos Logic 34:121–153, 2005) as a candidate for the basic logic of logical bilattices
Axiomatizations for propositional and modal team logic
A framework is developed that extends Hilbert-style proof systems for propositional and modal logics to comprehend their team-based counterparts. The method is applied to classical propositional logic and the modal logic K. Complete axiomatizations for their team-based extensions, propositional team logic PTL and modal team logic MTL, are presented
Axiomatizations for Propositional and Modal Team Logic
A framework is developed that extends Hilbert-style proof systems for propositional and modal logics to comprehend their team-based counterparts. The method is applied to classical propositional logic and the modal logic K. Complete axiomatizations for their team-based extensions, propositional team logic PTL and modal team logic MTL, are presented
Uniform Definability in Propositional Dependence Logic
Both propositional dependence logic and inquisitive logic are expressively
complete. As a consequence, every formula with intuitionistic disjunction or
intuitionistic implication can be translated equivalently into a formula in the
language of propositional dependence logic without these two connectives. We
show that although such a (non-compositional) translation exists, neither
intuitionistic disjunction nor intuitionistic implication is uniformly
definable in propositional dependence logic
Structural completeness in propositional logics of dependence
In this paper we prove that three of the main propositional logics of
dependence (including propositional dependence logic and inquisitive logic),
none of which is structural, are structurally complete with respect to a class
of substitutions under which the logics are closed. We obtain an analogues
result with respect to stable substitutions, for the negative variants of some
well-known intermediate logics, which are intermediate theories that are
closely related to inquisitive logic
Counterfactuals and dependencies on causal teams: expressive power and deduction systems
Peer reviewe
- …