Propositional logics of dependence

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.

[1]  Fan Yang,et al.  On Extensions and Variants of Dependence Logic : A study of intuitionistic connectives in the team semantics setting , 2014 .

[2]  Johannes Ebbing,et al.  Complexity of Model Checking for Modal Dependence Logic , 2011, SOFSEM.

[3]  Lauri Hella,et al.  The Expressive Power of Modal Dependence Logic , 2014, Advances in Modal Logic.

[4]  Juha Kontinen,et al.  On Definability in Dependence Logic , 2009, J. Log. Lang. Inf..

[5]  Jouko Väänänen,et al.  Modal Dependence Logic , 2008 .

[6]  Ivano Ciardelli,et al.  Dependency as Question Entailment , 2016, Dependence Logic.

[7]  Floris Roelofsen,et al.  Inquisitive semantics and pragmatics , 2009 .

[8]  Heribert Vollmer,et al.  Complexity Results for Modal Dependence Logic , 2010, Studia Logica.

[9]  P. Bernays.  Axiomatische Untersuchung des Aussagen-Kalkuls der “Principia Mathematica” , 1926 .

[10]  Fan Yang,et al.  UNIFORM DEFINABILITY IN PROPOSITIONAL DEPENDENCE LOGIC , 2014, The Review of Symbolic Logic.

[11]  Pietro Galliani,et al.  General Models and Entailment Semantics for Independence Logic , 2013, Notre Dame J. Formal Log..

[12]  Juha Kontinen,et al.  Axiomatizing first order consequences in dependence logic , 2012, Ann. Pure Appl. Log..

[13]  Ivano Ciardelli,et al.  Inquisitive Semantics and Intermediate Logics. , 2009 .

[14]  J. Reif,et al.  Lower bounds for multiplayer noncooperative games of incomplete information , 2001 .

[15]  E. F. Codd,et al.  Further Normalization of the Data Base Relational Model , 1971, Research Report / RJ / IBM / San Jose, California.

[16]  Gianluca Paolini,et al.  QUANTUM TEAM LOGIC AND BELL’S INEQUALITIES , 2014, The Review of Symbolic Logic.

[17]  Fan Yang,et al.  Structural completeness in propositional logics of dependence , 2015, Arch. Math. Log..

[18]  W. W. Armstrong,et al.  Dependency Structures of Data Base Relationships , 1974, IFIP Congress.

[19]  Erich Grädel,et al.  Dependence and Independence , 2012, Stud Logica.

[20]  Heribert Vollmer,et al.  Dependence Logic, Theory and Applications , 2016 .

[21]  Floris Roelofsen,et al.  Inquisitive Logic , 2011, J. Philos. Log..

[22]  Jouko A. Väänänen,et al.  Dependence Logic - A New Approach to Independence Friendly Logic , 2007, London Mathematical Society student texts.

[23]  Johannes Ebbing,et al.  Extended Modal Dependence Logic , 2013, WoLLIC.

[24]  Fan Yang,et al.  Model Checking for Modal Intuitionistic Dependence Logic , 2011, TbiLLC.

[25]  Pietro Galliani,et al.  The Doxastic Interpretation of Team Semantics , 2013, Logic Without Borders.

[26]  Grzegorz Rozenberg,et al.  Structures in Logic and Computer Science, A Selection of Essays in Honor of Andrzej Ehrenfeucht , 1997 .

[27]  Jouko Väänänen,et al.  From IF to BI , 2009, Synthese.

[28]  Larisa L. Maksimova.  On maximal intermediate logics with the disjunction property , 1986, Stud Logica.

[29]  Peter J. Cameron,et al.  Some combinatorics of imperfect information , 2001, Journal of Symbolic Logic.

[30]  Jonni Virtema,et al.  Axiomatizing Propositional Dependence Logics , 2015, CSL.

[31]  Wilfried Hodges,et al.  Some Strange Quantifiers , 1997, Structures in Logic and Computer Science.

[32]  Fan Yang,et al.  Expressing Second-order Sentences in Intuitionistic Dependence Logic , 2013, Studia Logica.

[33]  Hilary Putnam,et al.  Eine Unableitbarkeitsbeweismethode für den Intuitionistischen Aussagenkalkül , 1957, Arch. Math. Log..

[34]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[35]  J. Väänänen,et al.  Modal Dependence Logic , 2008 .

[36]  Jonni Virtema,et al.  Complexity of validity for propositional dependence logics , 2014, Inf. Comput..

[37]  K. Gödel.  Die Vollständigkeit der Axiome des logischen Funktionenkalküls , 1930 .

[38]  Emil L. Post.  Introduction to a General Theory of Elementary Propositions , 1921 .