On the Ehrenfeucht-Fraïssé Game in Theoretical Computer Science

An introduction to (first-order) Ehrenfeucht-Fraisse games is presented, and three applications in theoretical computer science are discussed. These are concerned with the expressive power of first-order logic over graphs, formal languages definable in first-order logic, and modal logic over labelled transition systems.

[1]  Neil Immerman.  Upper and lower bounds for first order expressibility , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).

[2]  Robin Milner,et al.  Operational and Algebraic Semantics of Concurrent Processes , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[3]  Ronald Fagin,et al.  A spectrum hierarchy , 1975, Math. Log. Q..

[4]  Andreas Potthoff.  Modulo Counting Quantifiers Over Finite Trees , 1992, CAAP.

[5]  H. Gaifman.  On Local and Non-Local Properties , 1982 .

[6]  Dana S. Scott.  A Note on Distributive Normal Forms , 1979 .

[7]  Ronald Fagin,et al.  Monadic generalized spectra , 1975, Math. Log. Q..

[8]  Phokion G. Kolaitis,et al.  On the expressive power of datalog: tools and a case study , 1990, J. Comput. Syst. Sci..

[9]  J. D. Monk,et al.  Mathematical Logic , 1976 .

[10]  W. Thomas,et al.  Relativized star-free expressions, first-order logic, and a concatenation game , 1988 .

[11]  Richard E. Ladner,et al.  Application of Model Theoretic Games to Discrete Linear Orders and Finite Automata , 1977, Inf. Control..

[12]  Robin Milner,et al.  Algebraic laws for nondeterminism and concurrency , 1985, JACM.

[13]  Jörg Flum,et al.  Mathematical logic , 1985, Undergraduate texts in mathematics.

[14]  R. Hilpinen,et al.  Essays in Honour of Jaakko Hintikka , 1979 .

[15]  Saharon Shelah,et al.  Rabin's uniformization problem , 1983, Journal of Symbolic Logic.

[16]  Jörg Flum,et al.  On Bounded Theories , 1991, CSL.

[17]  Wolfgang Thomas,et al.  A Concatenation Game and the Dot-Depth Hierarchy , 1987, Computation Theory and Logic.

[18]  J. Van Leeuwen,et al.  Handbook of theoretical computer science - Part A: Algorithms and complexity; Part B: Formal models and semantics , 1990 .

[19]  Uwe Bosse,et al.  An "Ehrenfeucht-Fraïssé Game" for Fixpoint Logic and Stratified Fixpoint Logic , 1992, CSL.

[20]  A. Ehrenfeucht.  An application of games to the completeness problem for formalized theories , 1961 .

[21]  Wolfgang Thomas.  An application of the Ehrenfeucht-Fraisse game in formal language theory , 1984 .

[22]  David Park,et al.  Concurrency and Automata on Infinite Sequences , 1981, Theoretical Computer Science.

[23]  Wolfgang Thomas.  On Chain Logic, Path Logic, and First-Order Logic over Infinite Trees , 1987, LICS.

[24]  J. Flum,et al.  First-order logic and its extensions , 1975 .

[25]  S. Shelah.  The monadic theory of order , 1975, 2305.00968.