Propositional Logics of Dependence
arXiv:1412.7998 · doi:10.1016/j.apal.2016.03.003
Abstract
In this paper, we study logics of dependence on the propositional level. We prove that several interesting propositional logics of dependence, including propositional dependence logic, propositional intuitionistic dependence logic as well as propositional inquisitive logic, are expressively complete and have disjunctive or conjunctive normal forms. We provide deduction systems and prove the completeness theorems for these logics.
References in corpus (4)
Cited by in corpus (22)
- Propositional Team Logics
- Questions and dependency in intuitionistic logic
- A Simple Logic of Functional Dependence
- Structural completeness in propositional logics of dependence
- Modal Dependence Logics: Axiomatizations and Model-theoretic Properties
- Interventionist Counterfactuals on Causal Teams
- Uniform Definability in Propositional Dependence Logic
- On Intermediate Inquisitive and Dependence Logics: An Algebraic Study
- Bisimulation in Inquisitive Modal Logic
- State-based Modal Logics for Free Choice
- Team semantics for interventionist counterfactuals and causal dependence
- Validity and Entailment in Modal and Propositional Dependence Logics
- On the Succinctness of Atoms of Dependency
- Parametrised Complexity of Model Checking and Satisfiability in Propositional Dependence Logic
- Complexity of Propositional Logics in Team Semantics
- Esakia Duals of Regular Heyting Algebras
- Inquisitive bisimulation
- Complexity Results in Team Semantics: Nonemptiness Is Not So Complex
- Diversity, Dependence and Independence
- Propositional union closed team logics
- Two-dimensional Kripke Semantics II: Stability and Completeness
- Complete logics for elementary team properties