Vince Bárány
Mikolaj Bojanczyk
2012
Finite satisfiability for guarded fixpoint logic
Inf. Process. Lett.
112
10
371–375
10.1016/j.ipl.2012.02.005
R. Berger
1966
The undecidability of the domino problem
Mem. AMS
66
Patrick Blackburn
Maarten de Rijke
Yde Venema
2001
Modal Logic
Cambridge Tracts in Theoretical Comp. Sc.
53
Cambridge University Press
Cambridge
Egon Börger
Erich Grädel
Yuri Gurevich
1997
The Classical Decision Problem
Perspectives in Mathematical Logic
Springer
Igor Gorbunov
2006
A decidable modal logic that is finitely undecidable
Guido Governatori
Ian M. Hodkinson
Yde Venema
Advances in Modal Logic
College Publications
247–258
http://www.aiml.net/volumes/volume6/Gorbunov.ps
Erich Grädel
1999
On the restraining power of guards
J. Symbolic Logic
64
1719–1742
10.2307/2586808
Erich Grädel
Igor Walukiewicz
1999
Guarded fixed point logic
Fourteenth Annual IEEE Symposium on Logic in Computer Science
45–54
10.1109/LICS.1999.782585
Yu. Sh. Gurevich
I. O. Koryakov
1972
Remarks on Berger's paper on the domino problem
Siberian Mathematical Journal
13
319–321
10.1007/BF00971620
Edith Hemaspaandra
1996
The Price of Universality
Notre Dame Journal of Formal Logic
37
174–203
10.1305/ndjfl/1040046086
Edith Hemaspaandra
Henning Schnoor
2008
On the Complexity of Elementary Modal Logics
Susanne Albers
Pascal Weil
STACS
LIPIcs
1
Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany
349–360
10.4230/LIPIcs.STACS.2008.1356
Edith Hemaspaandra
Henning Schnoor
2011
A Universally Defined Undecidable Unimodal Logic
Filip Murlak
Piotr Sankowski
MFCS
Lecture Notes in Computer Science
6907
Springer
364–375
10.1007/978-3-642-22993-0_34
Emanuel Kieroński
Jakub Michaliszyn
Jan Otop
2011
Modal Logics Definable by Universal Three-Variable Formulas
Supratik Chakraborty
Amit Kumar
FSTTCS
LIPIcs
13
Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik
264–275
10.4230/LIPIcs.FSTTCS.2011.264
Emanuel Kieroński
Jakub Michaliszyn
Ian Pratt-Hartmann
Lidia Tendera
2012
Two-variable first-order logic with equivalence closure
LICS '12: Proceedings of the 29th IEEE symposium on Logic in Computer Science
Emanuel Kieronski
Lidia Tendera
2007
On Finite Satisfiability of the Guarded Fragment with Equivalence or Transitive Guards
Nachum Dershowitz
Andrei Voronkov
LPAR
Lecture Notes in Computer Science
4790
Springer
318–332
10.1007/978-3-540-75560-9_24
Jakub Michaliszyn
2009
Decidability of the Guarded Fragment with the Transitive Closure
Susanne Albers
Alberto Marchetti-Spaccamela
Yossi Matias
Sotiris E. Nikoletseas
Wolfgang Thomas
ICALP (2)
Lecture Notes in Computer Science
5556
Springer
261–272
10.1007/978-3-642-02930-1_22
Jakub Michaliszyn
Emanuel Kieroński
2012
Finite Satisfiability of Universally-Horn Definable Modal Logics
Accepted to AIML 2012
http://www.ii.uni.wroc.pl/~jmi/papers/eml-finite12.pdf
Jakub Michaliszyn
Jan Otop
2012
Decidable Elementary Modal Logics
LICS '12: Proceedings of the 29th IEEE symposium on Logic in Computer Science
http://www.ii.uni.wroc.pl/~jmi/papers/horn.pdf
Angelo Montanari
Gabriele Puppis
Pietro Sala
2010
Maximal Decidable Fragments of Halpern and Shoham's Modal Logic of Intervals.
Samson Abramsky
Cyril Gavoille
Claude Kirchner
Friedhelm Meyer auf der Heide
Paul G. Spirakis
ICALP (2)
Lecture Notes in Computer Science
6199
Springer
345–356
10.1007/978-3-642-14162-1_29
Michael Mortimer
1975
On languages with two variables
Mathematical Logic Quarterly
21
1
135–140
10.1002/malq.19750210118
Martin Otto
1998
Two Variable First-Order Logic over Ordered Domains
Journal of Symbolic Logic
66
685–702
10.2307/2695037
Henrik Sahlqvist
1973
Completeness and correspondence in the first and second order semantics for modal logic
Proceedings of the Third Scandinavian Logic Symposium
10.1016/S0049-237X(08)70728-6
M. Y. Vardi
1997
Why is modal logic so robustly decidable?
DIMACS Series in Discrete Mathematics and Theoretical Computer Science,
31
149–184