On the Ehrenfeucht-Fraïssé game in theoretical computer science

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

Volumn 668 LNCS, Issue , 1993, Pages 559-568

  Thomas, Wolfgang ^a  

^a UNIVERSITY OF KIEL   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

FORMAL LANGUAGES; FORMAL LOGIC; SOFTWARE DESIGN;

EXPRESSIVE POWER; FIRST ORDER; FIRST ORDER LOGIC; LABELLED TRANSITION SYSTEMS; MODAL LOGIC; THEORETICAL COMPUTER SCIENCE;

COMPUTER GAMES;

EID: 84969357003     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-56610-4_89     Document Type: Conference Paper

References (32)

1. J.Barwise, S. Feferman (eds.), Model-Theoretic Logics, Springer-Vedag, Berin-Heidelberg, New York 1985.
2. U. Bosse, Art “Ehrenfeucht-Fraïssé game” for fixpoint logic and stratified fixpoint logic, manuscript, Math. Inst., Universität Freiburg, 1992.
3. H.D. Ebbinghaus, J. Flum, W. Thomas, Mathematical Logic, Springer-Verlag, New York 1984 (revised and extended edition to appear 1993).
4. A. Ehrenfeucht, Art application of games to the completeness problem for formalized theories, Fund. Math. 49 (1961), 129-141.
5. R. Fagin, Monadic generalized spectra, Z. math. Logik u. Grundl. Math. 21 (1975), 123-134.
6. R. Fagin, L. Stockmeyer, M.Y. Vardi, A simple proof that connectivity sepaxates existential and universal monadic second-order logic over finite structures, IBM Rep. RJ 8647, 1992.
7. J. Flum, First-order logic amd its extensions, in: Proc. ISILC Logic ConL, Kiel, Springer Lect. Notes in Math. 499 (1975), 248-310.
8. J. Flum, On bounded theories, in: Computer Science Logic (E. Bbrger et al., eds.), Springer LNCS 626 (1992), 111-118.
9. R. Fraïssé, Sur quelques classifications des relations, basés sur des isomorphismes restreints, Publ. Sci. de l’Univ. Alger, Sér. A 1 (1954), 35-182.
10. H. Gaifman, On local and non-local properties, in: Proc. of the Herbrand Symposium, Logic Colloquium '81 (J. Stern, ed.), North-Holland, Amsterdam 1982, pp. 105-135.
11. E. Grs On transitive closure logic, in: Computer Science Logic (E. Bérger et al., ads.), Springer LNCS 626 (1992), 149-165.
12. Y. Gurevich, S. Shelah, Rabin’s uniformization problem, 3. Symb. Logic 48 (1983), 1105-1119.
13. W.P. Hanf, Model-theoretic methods in the study of elementary logic, in: The Theory of Models (J.W. Addison, L. Henkin, A. Tarski, eds.), North-Holland, Amsterdam 1965, pp. 132-145.
14. M. Hennessy, R. Milner, Algebraic laws for nondeterminism and concurrency, J. Assoc. Comput. Much. 21 (1985), 137-161.
15. J. Hintikka, Distributive normal forms in the calculus of predicates, Acta Philos. Fennica 6 (1953).
16. N. Immerman, Upper and lower bounds for first-order expressibility, J. Cornput. System Sci. 25 (1982), 76-98.
17. N. Immerman, D. Kozen, Definability with a bounded number of bound variables, Inform. Comput. 83 (1989), 121-139.
18. Ph. Kolaitis, M. Vardi, On the expressive power of Datalog: Tools and a case study, Proc. 9th ACM Symp. on Principles of Database Systems, 61-71.
19. R.E. Ladner, Application of model-theoretic games to discrete linear orders and finite automata, Inform. Contr. 33 (1977), 281-303.
20. D. Lippert, W. Thomas, Relativized star-free expressions, first-order logic, and a concatenation game, in: Seafigroup Theory and Applications (H. Jfirgensen et al. eds.), Springer Lect. Notes in Math. 1320 (1988), 194-204.
21. R. Milner, Operational and algebraic semantics of concurrent processes, in: Handbook of Theoretical Computer Science (J. v. Leeuwen, ed.), Vol. B, Elsevier Science Publ., Amsterdam 1990, pp. 1201-1241.
22. D. Monk, Mathematical Logic, Springer-Verlag, New York 1976.
23. H. Oguztiizfin, A fragment of first-order logic adequate for observation equivalence, in: Computer Science Logic (E. BSrger et ai., eds.), Springer LNCS 626 (1992), 287-291.
24. D. Park, Concurrency and automata on infinite sequences, in: Theoretical Computer Science (P. Deussen, ed.), Springer LNCS 104 (1981), 167-183.
25. A. Potthoff, Modulo counting quantifiers over finite trees, in: CAAP’92 (J.C. Raoult, ed.), LNCS 581 (1992), 265-278.
26. J.G. Rosenstein, Linear Orderings, Academic Press, New York 1982.
27. D. Scott, A note on distributive normal forms, in: Essays in Honour of Jaakko Hintikka (E. Saatinen et al., eds.), Reidel, Dordrecht 1979, pp. 75-90.
28. S. Shelah, The monadic theory of order, Ann. Math. 102 (1975), 379-419.
29. W. Thomas, An application of the Ehrenfeucht-Fraiss6 game in formal language theory, Bull. Soc. Math. France, Mere. 16 (1984), 11-21.
30. W. Thomas, A concatenation game and the dot-depth hierarchy, in: Computation Theory and Logic (E. Bérger, ed.), LNCS 270 (1987), 415-426.
31. W. Thomas, On chain logic, path logic, and first-order logic over infinite trees, Proc. 2nd LICS, Ithaca, N.Y. 1987, 245-256.
32. W. Thomas, On logics, tilings, and automata, in: Proc. 18th ICALP, Madrid (J. Leach Albert et al., ads.), Springer LNCS 510 (1991), 441-454.