Propositional logics of dependence

From MaRDI portal



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.


The paper studies propositional downward closed team logic (\(\mathsf{PT}_0\)), propositional dependence logic (\(\mathsf{PD}\)), propositional dependence logic with intuitionistic disjunction (\(\mathsf{PD}^\lor\)), propositional intuitionistic dependence logic (\(\mathsf{PID}\)), and propositional inquisitive logic (\(\mathsf{InqL}\)) are studied.NEWLINENEWLINE\(\mathsf{PD}\) and \(\mathsf{PID}\) are the propositional counterparts of known first-order logics of dependence. The sound and strongly complete deductive systems for logics \(\mathsf{PD}\), \(\mathsf{PD}^\lor\) and \(\mathsf{PID}\) have been constructed.NEWLINENEWLINEIt is proven that all of the logics \(\mathsf{PT}_0\), \(\mathsf{PD}\), \(\mathsf{PD}^\lor\), \(\mathsf{InqL}\) and \(\mathsf{PID}\) are expressively complete, expressively equivalent and compact.




Cited in
(62)








This page was built for publication: Propositional logics of dependence

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q278765)