by Thomas Schwentick, Klaus Barthelmann
Discrete Mathematics and Theoretical Computer Science
http://dmtcs.loria.fr/volumes/abstracts/pdfpapers/dm030303.pdf
Add To MetaCart
Abstract:
Building on work of Gaifman [Gai82] it is shown that every first-order formula is logically equivalent to a formula of the form ∃x1,..., xl∀yϕ where ϕ is r-local around y, i. e. quantification in ϕ is restricted to elements of the universe of distance at most r from y. From this and related normal forms, variants of the Ehrenfeucht game for first-order and existential monadic second-order logic are developed that restrict the possible strategies for the spoiler, one of the two players. This makes proofs of the existence of a winning strategy for the duplicator, the other player, easier and can thus simplify inexpressibility proofs. As another application, automata models are defined that have, on arbitrary classes of relational structures, exactly the expressive power of first-order logic and existential monadic second-order logic, respectively. Keywords: First-order logic, existential monadic second-order logic, games, automata, locality 1
Citations
|
461
|
The complexity of relational query languages
– Vardi
- 1982
|
|
378
|
Finite Model Theory
– Ebbinghaus, Flum
- 1999
|
|
268
|
Relational queries computable in polynomial time
– Immerman
- 1986
|
|
242
|
Generalized first-order spectra and polynomial-time recognizable sets
– Fagin
- 1974
|
|
145
|
An application of games to the completeness problem for formalized theory. Fundamenta Mathematicae
– Ehrenfeucht
- 1961
|
|
141
|
The monadic second-order logic of graphs I: Recognizable sets of finite graphs
– Courcelle
- 1990
|
|
107
|
On local and non-local properties
– Gaifman
- 1982
|
|
80
|
On monadic NP vs. monadic co-NP
– Fagin, Stockmeyer, et al.
- 1995
|
|
69
|
On Moschovakis closure ordinals
– Barwise
- 1977
|
|
68
|
Reachability is harder for directed than for undirected finite graphs
– Ajtai, Fagin
- 1990
|
|
64
|
quelques classifications des systèmes de relations
– Sur
- 1954
|
|
51
|
Upper and lower bounds for first-order expressibility
– Immerman
- 1982
|
|
50
|
Model-theoretic methods in the study of elementary logic
– Hanf
- 1965
|
|
48
|
Computing with first-order logic
– Abiteboul, Vianu
- 1995
|
|
41
|
Expressibility as a complexity measure: Results and directions
– Immerman
- 1987
|
|
37
|
Fixpoint extensions of first-order logic and Datalog-like languages
– Abiteboul, Vianu
- 1989
|
|
34
|
L.: Local Properties of Query Languages
– Dong, Libkin, et al.
- 1997
|
|
30
|
Capturing complexity classes by fragments of second order logic
– Gradel
- 1992
|
|
28
|
Descriptive characterizations of computational complexity
– Leivant
- 1987
|
|
22
|
On logics, tilings, and automata
– Thomas
- 1991
|
|
21
|
Monadic second-order logic of graphs VII: graphs as relational structures, Theoret
– Courcelle
- 1992
|
|
19
|
Graph connectivity, monadic NP and built-in relations of moderate degree
– Schwentick
- 1995
|
|
18
|
The monadic second-order logic of graphs X: linear orderings
– Courcelle
- 1996
|
|
18
|
On the Forms of Locality over Finite Models
– Libkin
- 1997
|
|
16
|
On winning Ehrenfeucht games and monadic NP
– Schwentick
- 1996
|
|
15
|
On winning strategies in Ehrenfeucht-Fraïssé games
– Arora, Fagin
- 1997
|
|
14
|
Automata theory on trees and partial orders
– Thomas
- 1997
|
|
10
|
Easier ways to win logical games
– Fagin
- 1997
|
|
9
|
Elements of an automata theory over partial orders
– Thomas
- 1996
|
|
8
|
Sur quelques classifications des systemes de relations
– Frasse
- 1954
|
|
8
|
Unary quantifiers, transitive closure, and relations of large degree
– Libkin, Wong
- 1998
|
|
8
|
Second-order Ehrenfeucht games and the decidability of the second-order theory of an equivalence relation
– Tenney
- 1975
|
|
5
|
Some useful preservation theorems
– Compton
- 1983
|
|
5
|
The Ehrenfeucht--Fraiss'e games for transitive closure
– Cal`o, Makowsky
- 1992
|
|
2
|
The Ehrenfeucht-Frasse games for transitive closure logic. Unpublished manuscript
– Calo, Makowsky
- 1991
|
|
2
|
den Bussche. A computational model for generic graph functions
– Gemis, Paredaens, et al.
- 1994
|
|
1
|
On winning strategies in Ehrenfeucht--Frasse games
– Arora, Fagin
- 1997
|
