Local normal forms for first-order logic with applications to games and automata

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1373 LNCS, Issue , 1998, Pages 444-454

  Schwentick, Thomas ^a   Barthelmann, Klaus ^a  

^a JOHANNES GUTENBERG UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA MODELS; EHRENFEUCHT GAME; EXPRESSIVE POWER; FIRST ORDER LOGIC; FIRST-ORDER; FIRST-ORDER FORMULAS; MONADIC SECOND-ORDER LOGIC; NORMAL FORM; RELATIONAL STRUCTURES; WINNING STRATEGY;

COMPUTER SCIENCE;

FORMAL LOGIC;

EID: 26844445953     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0028580     Document Type: Conference Paper

References (16)

1. Sanjeev Arora and Ronald Fagin. On winning strategies in Ehrenfeucht-Fraïssé games. Theoretical Computer Science, 174(1-2):97-121, 1997.
2. K. Compton. Some useful preservation theorems. Journal of Symbolic Logic, 48:427-440, 1983.
3. G. Dong, L. Libkin, and L. Wong. Local properties of query languages. In Proc. Int. Conf. on Database Theory, LNCS, pages 140-154. Springer-Verlag, 1997.
4. H.-D. Ebbinghaus and J. Flum. Finite Model Theory. Springer-Verlag, 1995.
5. A. Ehrenfeucht. An application of games to the completeness problem for formalized theories. Fund. Math., 49:129-141, 1961.
6. R. Fagin. Generalized first-order spectra and polynomial-time recognizable sets. In R. M. Karp, editor, Complexity of Computation, SIAM-AMS Proceedings, Vol. 7, pages 43-73, 1974.
7. R. Fagin. Easier ways to win logical games. In Proceedings of the DIMACS Workshop on Finite Models and Descriptive Complexity. American Mathematical Society, 1997.
8. R. Fraïssé. Sur quelques classifications des systèmes de relations. Publ. Sci. Univ. Alger. Sér. A, 1:35-182, 1954.
9. R. Fagin, L. Stockmeyer, and M. Vardi. On monadic NP vs. monadic co-NP. Information and Computation, 120:78-92, 1995.
10. Preliminary version appeared in 1993 IEEE Conference on Structure in Complexity Theory, pp. 19-30.
11. H. Gaifman. On local and nonlocal properties. In J. Stern, editor, Logic Colloquium '81, pages 105-135. North Holland, 1982.
12. W. Hanf. Model-theoretic methods in the study of elementary logic. In J. Addison, L. Henkin, and A. Tarski, editors, The Theory of Models, pages 132-145. North Holland, 1965.
13. L. Libkin. On the forms of locality over finite models. In Proe. 12th IEEE Symp. on Logic in Computer Science, 1997.
14. T. Schwentick. On winning Ehrenfeucht games and monadic NP. Annals of Pure and Applied Logic, 79:61-92, 1996.
15. W. Thomas. On logics, tilings and automata. In Proc. ICALP'91, number 510 in Lecture Notes in Computer Science, pages 441-453. Springer, 1991.
16. W. Thomas. Automata theory on trees and partial orders. In Proc. TAPSOFT'97, number 1214 in Lecture Notes in Computer Science, pages 20-38. Springer, 1997.