Undecidability of Compass Logic

It is known that the tiling technique can be used to give simple proofs of undecidability of various two-dimensional modal and temporal logics. However, up until now, the simplest two-dimensional temporal logic, the compass logic of Venema, has eluded such treatment. We present a new coding of an enumeration of the tiling plane which enables us to show that the compass logic is undecidable.

[1]  Robert L. Berger.  The undecidability of the domino problem , 1966 .

[2]  R. Robinson.  Undecidability and nonperiodicity for tilings of the plane , 1971 .

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

[4]  Lennart Åqvist.  A conjectured axiomatization of two-dimensional Reichenbachian tense logic , 1979, J. Philos. Log..

[5]  S. K. Thomason.  Independent propositional modal logics , 1980 .

[6]  A. Prasad Sistla,et al.  A Multiprocess Network Logic with Temporal and Spatial Modalities , 1983, ICALP.

[7]  D. Harel.  Recurring dominoes: making the highly undecidable highly understandable , 1985 .

[8]  Richard T. Snodgrass,et al.  A taxonomy of time databases , 1985, SIGMOD Conference.

[9]  David Harel,et al.  Effective transformations on infinite trees, with applications to high undecidability, dominoes, and fairness , 1986, JACM.

[10]  Joseph Y. Halpern,et al.  The Complexity of Reasoning about Knowledge and Time. I. Lower Bounds , 1989, J. Comput. Syst. Sci..

[11]  Giovanni Sambin,et al.  A new proof of Sahlqvist's theorem on modal definability and completeness , 1989, Journal of Symbolic Logic.

[12]  Yde Venema,et al.  Expressiveness and Completeness of an Interval Tense Logic , 1990, Notre Dame J. Formal Log..

[13]  Yoav Shoham,et al.  A propositional modal logic of time intervals , 1991, JACM.

[14]  Dov M. Gabbay,et al.  Adding a temporal dimension to a logic system , 1992, J. Log. Lang. Inf..

[15]  Marcelo Finger.  Handling database updates in two-dimensional temporal logic , 1992, J. Appl. Non Class. Logics.

[16]  Temporal Logic , 1994, Lecture Notes in Computer Science.

[17]  Alberto Zanardo,et al.  Synchronized Histories in Prior-Thomason Representation of Branching Time , 1994, ICTL.

[18]  D. Gabbay,et al.  Temporal Logic Mathematical Foundations and Computational Aspects , 1994 .

[19]  Ronald Fagin,et al.  Reasoning about knowledge , 1995 .

[20]  Brandon Bennett,et al.  Modal Logics for Qualitative Spatial Reasoning , 1996, Log. J. IGPL.

[21]  Alberto Zanardo,et al.  Branching-time logic with quantification over branches: The point of view of modal logic , 1996, Journal of Symbolic Logic.

[22]  maarten marx.  Complexity of Modal Logics of RelationsMaarten MarxDepartment of Computing , 1997 .

[23]  Maarten Marx,et al.  Multi-dimensional modal logic , 1997, Applied logic series.

[24]  Witold Lukaszewicz,et al.  Reasoning about Plans , 1997, IJCAI.

[25]  Yde Venema,et al.  A modal logic of relations , 1999 .

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

[27]  Marcelo Finger,et al.  Two-dimensional Executable Temporal Logic for Bitemporal Databases , 2000 .