Abstract
Building on work of Gaifman [Gai82] it is shown that every first-order formula is logically equivalent to a formula of the form ∃χ1...,χl∀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.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Sanjeev Arora and Ronald Fagin. On winning strategies in EhrenfeuchtFraïssé games. Theoretical Computer Science, 174(1–2):97–121, 1997.
K. Compton. Some useful preservation theorems. Journal of Symbolic Logic, 48:427–440, 1983.
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.
H.-D. Ebbinghaus and J. Flum. Finite Model Theory. Springer-Verlag, 1995.
A. Ehrenfeucht. An application of games to the completeness problem for formalized theories. Fund. Math., 49:129–141, 1961.
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.
R. Fagin. Easier ways to win logical games. In Proceedings of the DIMACS Workshop on Finite Models and Descriptive Complexity. American Mathematical Society, 1997.
R. Fraïssé. Sur quelques classifications des systèmes de relations. Publ. Sci. Univ. Alger. Sér. A, 1:35–182, 1954.
R. Fagin, L. Stockmeyer, and M. Vardi. On monadic NP vs. monadic coNP. Information and Computation, 120:78–92, 1995. Preliminaxy version appeared in 1993 IEEE Conference on Structure in Complexity Theory, pp. 19–30.
H. Gaifman. On local and nonlocal properties. In J. Stern, editor, Logic Colloquium '81, pages 105–135. North Holland, 1982.
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.
L. Libkin. On the forms of locality over finite models. In Proc. 12th IEEE Symp. on Logic in Computer Science, 1997.
T. Schwentick. On winning Ehrenfeucht games and monadic NP. Annals of Pure and Applied Logic, 79:61–92, 1996.
W. Thomas. On logics, tilings and automata. In Proc. ICALP'91, number 510 in Lecture Notes in Computer Science, pages 441-453. Springer, 1991. [Tho97] 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.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag
About this paper
Cite this paper
Schwentick, T., Barthelmann, K. (1998). Local normal forms for first-order logic with applications to games and automata. In: Morvan, M., Meinel, C., Krob, D. (eds) STACS 98. STACS 1998. Lecture Notes in Computer Science, vol 1373. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0028580
Download citation
DOI: https://doi.org/10.1007/BFb0028580
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64230-5
Online ISBN: 978-3-540-69705-3
eBook Packages: Springer Book Archive