Logo image
Undecidability of compass logic
Journal article   Peer reviewed

Undecidability of compass logic

M. Marx and M. Reynolds
Journal of Logic and Computation, Vol.9(6), pp.897-914
1999
url
Link to Published Version *Subscription may be requiredView
url
Free to Read *No subscription requiredView

Abstract

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.

Details

Metrics

InCites Highlights

These are selected metrics from InCites Benchmarking & Analytics tool, related to this output

Citation topics
4 Electrical Engineering, Electronics & Computer Science
4.47 Software Engineering
4.47.408 Model Checking
Web Of Science research areas
Computer Science, Theory & Methods
Logic
ESI research areas
Computer Science
Logo image