Download:
|
by Erich Gradel, Martin Otto
Theoretical Computer Science
http://www-mgi.informatik.rwth-aachen.de/Publications/pub/graedel/GrOt-tcs99.ps
Add To MetaCart
Abstract:
This paper is a survey and systematic presentation of decidability and complexity issues for modal and non-modal two-variable logics. A classical result due to Mortimer says that the two-variable fragment of firstorder logic, denoted FO 2, has the finite model property and is therefore decidable for satisfiability. One of the reasons for the significance of this result is that many propositional modal logics can be embedded into FO 2 Logics that are of interest for knowledge representation, for the specification and verification of concurrent systems and for other areas of computer science are often defined (or can be viewed) as extensions of modal logics by features like counting constructs, path quantifiers, transitive closure operators, least and greatest fixed points etc. Examples of such logics are computation tree logic CTL, the modal-calculus L, or popular description logics used in artificial intelligence. Although the additional features are usually not first-order constructs, the resulting logics can still be seen as two-variable logics that are embedded in suitable extensions of FO
Citations
|
1069
|
A calculus of communicating systems
– Milner
- 1980
|
|
996
|
Automatic verification of finite-state concurrent systems using temporal logic specifications
– Clarke, Emerson, et al.
- 1986
|
|
307
|
A Shorter Model Theory
– Hodges
- 1997
|
|
210
|
P.: An automata-theoretic approach to branching-time model checking
– Bernholtz, Vardi, et al.
- 1994
|
|
185
|
The undecidability of the dominoe problem
– Berger
- 1966
|
|
76
|
Why is modal logic so robustly decidable
– Vardi
- 1997
|
|
67
|
On model-checking for fragments of _-calculus
– Emerson, Jutla, et al.
- 1993
|
|
48
|
On the complexity of bounded-variable queries
– Vardi
- 1995
|
|
47
|
Describing graphs: A first-order approach to graph canonization
– Immerman, Lander
- 1990
|
|
45
|
Undecidable Theories
– Robinson
- 1953
|
|
34
|
Complexity Results for Classes of Quantificational Formulas
– Lewis
- 1980
|
|
29
|
On the decision problem for two-variable first-order logic
– Kolaitis, Vardi
- 1997
|
|
21
|
A finite model theorem for the propositional -calculus
– Kozen
- 1988
|
|
21
|
A decision method for validity of sentences in two variables
– Scott
- 1962
|
|
20
|
Complexity of two-variable logic with counting
– Pacholski, Szwast, et al.
- 1997
|
|
18
|
Model checking and transitive closure logic
– Immerman, Vardi
- 1997
|
|
17
|
The Classical Decision Problem
– orger, adel, et al.
- 1997
|
|
15
|
Benthem, Modal Logic and Classical Logic
– van
- 1983
|
|
11
|
BENTHEM, Exploring Logical Dynamics
– VAN
- 1996
|
|
11
|
On languages with two variables, Zeitschr. f. math. Logik u. Grundlagen d
– Mortimer
- 1975
|
|
10
|
Remarks on Berger's paper on the domino problem
– Gurevich, Koryakov
- 1972
|
|
7
|
Bounded-variable fixpoint queries are PSPACE-complete
– DZIEMBOWSKI
- 1996
|
|
7
|
Local model checking games (Extended abstract
– Stirling
- 1995
|
|
4
|
On the boundedness problem for two-variable first-order logic
– Kolaitis, Otto
- 1998
|
|
3
|
Benthem, Dynamic bits and pieces
– van
- 1997
|
|
3
|
The computational complexity of the unconstrained limited domino problem (with implications for logical decision problems
– urer
- 1984
|
|
2
|
Undecidability results on two-variable logics, to appear in Archive of Mathematical Logic. A preliminary version has appeared
– adel, Otto, et al.
- 1997
|
|
2
|
Zur Modelltheorie von L
– Herwig
- 1989
|
|
2
|
Capturing bisimulation-invariant Ptime
– Otto
- 1997
|
|
1
|
On the restraining power of guards, submitted for publication
– adel
- 1997
|
