The Decision Problem of Modal Product Logics with a Diagonal, and Faulty Counter Machines

In the propositional modal (and algebraic) treatment of two-variable first-order logic equality is modelled by a ‘diagonal’ constant, interpreted in square products of universal frames as the identity (also known as the ‘diagonal’) relation. Here we study the decision problem of products of two arbitrary modal logics equipped with such a diagonal. As the presence or absence of equality in two-variable first-order logic does not influence the complexity of its satisfiability problem, one might expect that adding a diagonal to product logics in general is similarly harmless. We show that this is far from being the case, and there can be quite a big jump in complexity, even from decidable to the highly undecidable. Our undecidable logics can also be viewed as new fragments of first-order logic where adding equality changes a decidable fragment to undecidable. We prove our results by a novel application of counter machine problems. While our formalism apparently cannot force reliable counter machine computations directly, the presence of a unique diagonal in the models makes it possible to encode both lossy and insertion-error computations, for the same sequence of instructions. We show that, given such a pair of faulty computations, it is then possible to reconstruct a reliable run from them.

[1]  Emmanuel Jeandel,et al.  The Undecidability of the Domino Problem , 2020, Lecture Notes in Mathematics.

[2]  V. B. Shekhtman.  Two-dimensional modal logic , 1978 .

[3]  Stephan Tobies,et al.  Complexity results and practical algorithms for logics in knowledge representation , 2001, ArXiv.

[4]  Algebraic logic , 1985, Problem books in mathematics.

[5]  Maarten Marx,et al.  Undecidability of Compass Logic , 1999, J. Log. Comput..

[6]  K. Gödel.  Zum Entscheidungsproblem des logischen Funktionenkalküls , 1933 .

[7]  M. Wajsberg,et al.  Ein erweiterter Klassenkalkül , 1933 .

[8]  Mark Reynolds,et al.  A Decidable Temporal Logic of Parallelism , 1997, Notre Dame J. Formal Log..

[9]  K. Fine.  Logics containing K4. Part II , 1985, Journal of Symbolic Logic.

[10]  Jean Christoph Jung,et al.  Lightweight Description Logics and Branching Time: A Troublesome Marriage , 2014, KR.

[11]  Richard Spencer-Smith,et al.  Modal Logic , 2007 .

[12]  Jean Christoph Jung,et al.  The Complexity of Decomposing Modal and First-Order Theories , 2012, 2012 27th Annual IEEE Symposium on Logic in Computer Science.

[13]  Michael Zakharyaschev,et al.  Modal Logic , 1997, Oxford logic guides.

[14]  Yde Venema,et al.  Many-dimensional Modal Logic , 1991 .

[15]  Christopher Hampson,et al.  Undecidable Propositional Bimodal Logics and One-Variable First-Order Linear Temporal Logics with Counting , 2014, ACM Trans. Comput. Log..

[16]  Richard Mayr.  Undecidable problems in unreliable computations , 2003, Theor. Comput. Sci..

[17]  Michael Mortimer,et al.  On languages with two variables , 1975, Math. Log. Q..

[18]  Willard Van Orman Quine,et al.  Algebraic Logic and Predicate Functors , 1971 .

[19]  Frank Wolter,et al.  Products of ‘transitive” modal logics , 2005, Journal of Symbolic Logic.

[20]  D. Gabbay,et al.  Many-Dimensional Modal Logics: Theory and Applications , 2003 .

[21]  Valentin B. Shehtman.  On squares of modal logics with additional connectives , 2011 .

[22]  Renate A. Schmidt,et al.  Combining Dynamic Logic with Doxastic Modal Logics , 2002, Advances in Modal Logic.

[23]  M. de Rijke,et al.  Modal Logic , 2001, Cambridge Tracts in Theoretical Computer Science.

[24]  Krister Segerberg,et al.  Two-dimensional modal logic , 1973, J. Philos. Log..

[25]  Phokion G. Kolaitis,et al.  On the Decision Problem for Two-Variable First-Order Logic , 1997, Bulletin of Symbolic Logic.

[26]  Thomas A. Henzinger,et al.  A really temporal logic , 1994, JACM.

[27]  Steven T. Kuhn.  Quantifiers as modal operators , 1980 .

[28]  Patrick Blackburn,et al.  Hybrid languages , 1995, J. Log. Lang. Inf..

[29]  A. Chagrov,et al.  Modal Logic (Oxford Logic Guides, vol. 35) , 1997 .

[30]  Krister Segerberg,et al.  Modal logics with linear alternative relations , 2008 .

[31]  Dov M. Gabbay,et al.  Products of modal logics. Part 2: Relativised quantifiers in classical logic , 2000, Log. J. IGPL.

[32]  Ágnes Kurucz,et al.  Products of Modal Logics with Diagonal Constant Lacking the Finite Model Property , 2009, FroCoS.

[33]  Dov M. Gabbay,et al.  Products of Modal Logics, Part 1 , 1998, Log. J. IGPL.

[34]  Agi Kurucz.  Representable Cylindric Algebras and Many-Dimensional Modal Logics , 2013 .

[35]  Frank Wolter.  The product of converse PDL and polymodal K , 2000, J. Log. Comput..

[36]  Kit Fine,et al.  Logics containing K4. Part I , 1974, Journal of Symbolic Logic.

[37]  Maarten Marx,et al.  Complexity of Products of Modal Logics , 1999, J. Log. Comput..

[38]  Valentin B. Shehtman,et al.  Products of modal logics , 2013 .

[40]  Agi Kurucz,et al.  Combining modal logics , 2007, Handbook of Modal Logic.

[41]  Michael Zakharyaschev,et al.  On the Products of Linear Modal Logics , 2001, J. Log. Comput..

[42]  Warren D. Goldfarb.  The Unsolvability of the Godel Class with Identity , 1984, J. Symb. Log..

[43]  A. Tarski,et al.  Cylindric Algebras. Part II , 1988 .

[44]  Joël Ouaknine,et al.  On Metric Temporal Logic and Faulty Turing Machines , 2006, FoSSaCS.