Abstract
The subject of this paper is the expressive power of monadic second-order logic over two-dimensional grids. We give a new, self-contained game-theoretical proof of the nonexpressibility results of Matz and Thomas. As we show, this implies the strictness of the monadic second-order quantifier alternation hierarchy over grids.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
M. Ajtai, R. Fagin, L. Stockmeyer. The Closure of Monadic NP. IBM Research Report RJ 10092, November 1997.
J. R. Büchi. Weak second-order arithmetic and finite automata. Z. Math. Logik Grundl. Math. 6 (1960), 66–92.
J. Doner. Tree acceptors and some of their applications. J. Comput. System Sci. 4 (1970), 405–451.
H. Ebbinghaus, J. Flum. Finite Model Theory. Springer-Verlag, New York, 1995.
A. Ehrenfeucht. An application of games to the completeness problem for formalized theories. Fund. Math. 49 (1961), 129–141.
C. Elgot. Decision problems of finite automata design and related arithmetics. Trans. Amer. Math. Soc., page 21, 1961.
R. Fagin. Generalized first-order spectra and polynomial-time recognizable sets. Complexity of Computation (R.M. Karp, Ed.), SIAM-AMS Proceedings 7 (1974), 43–73.
R. Fagin. Monadic generalized spectra. Zeitschrift für Mathematische Logik and Grundlagen der Mathematik 21 (1975), 89–96.
R. Fagin. Problem proposed in Oberwolfach Meeting 1994; published in: Collection of open problems in finite model theory, see http://speedy.informatik.rwth-aachen.de/WWW/FMT.html
R. Fraïssé. Sur quelques classification des systèmes de relations (english summary). Université d'Alger, Publications Scientifiques, Série A, 1, 35–182, 1954.
R. Fagin, L. Stockmeyer, M. Vardi. On monadic NP vs. monadic co-NP. Information and Computation 120 (1995), 78–92.
D. Giammarresi, A. Restivo, S. Seibert, W. Thomas. Monadic second-order logic and recognizability by tiling systems. Information and Computation 125 (1996), 32–45.
J. Makowsky, Y. Pnueli. Arity vs Alternation in Second Order Logic. Logical Foundations of Computer Science. Lecture Notes in Computer Science, Vol. 813, pages 240–252, Springer-Verlag, 1994.
O. Matz and W. Thomas. The monadic quantifier alternation hierarchy over graphs is infinite. Proceedings of the 12th IEEE Symposium on Logic in Computer Science (1997), to appear.
M. Otto. Note on the number of monadic quantifiers in monadic σ 11 . Information Processing Letters 53 (1995), 337–339.
N. Schweikardt. The Monadic Second-Order Quantifier Alternation Hierarchy over Grids and Pictures. Diploma thesis, Johannes Gutenberg-Universität Mainz, 1997.
T. Schwentick. On winning Ehrenfeucht games and monadic NP. Annals of Pure and Applied Logic 79 (1996), 61–92.
L. Stockmeyer. The Polynomial Time Hierarchy. Theoretical Computer Science 3 (1977), 1–22.
W. Thomas. Classifying regular events in symbolic logic. Journal of Computer and System Sciences 25 (1982), 360–376.
J. W. Thatcher, J. B. Wright. Generalized finite automata with an application to a decision problem of second order logic. Math. Syst. Theory 2 (1968), 57–82.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Schweikardt, N. (1998). The monadic quantifier alternation hierarchy over grids and pictures. In: Nielsen, M., Thomas, W. (eds) Computer Science Logic. CSL 1997. Lecture Notes in Computer Science, vol 1414. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0028030
Download citation
DOI: https://doi.org/10.1007/BFb0028030
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64570-2
Online ISBN: 978-3-540-69353-6
eBook Packages: Springer Book Archive