Abstract
In this paper we introduce so-called asymptotic logics, logics that are meant to reason about weights of elements in a model in a way inspired by topology. Our main subject of study is Asymptotic Monadic Second-Order Logic over infinite words. This is a logic talking about ω-words labelled by integers. It contains full monadic second-order logic and can express asymptotic properties of integers labellings.
We also introduce several variants of this logic and investigate their relationship to the logic MSO+\(\mathbb{U}\). In particular, we compare their expressive powers by studying the topological complexity of the different models. Finally, we introduce a certain kind of tiling problems that is equivalent to the satisfiability problem of the weak fragment of asymptotic monadic second-order logic, i.e., the restriction with quantification over finite sets only.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Bojańczyk, M.: The finite graph problem for two-way alternating automata. Theoret. Comput. Sci. 298(3), 511–528 (2003)
Bojańczyk, M.: Weak MSO with the unbounding quantifier. In: STACS. LIPIcs, vol. 3, pp. 159–170 (2009)
Bojańczyk, M., Colcombet, T.: Bounds in ω-regularity. In: LICS 2006, pp. 285–296 (2006)
Bojańczyk, M., Gogacz, T., Michalewski, H., Skrzypczak, M.: On the decidability of mso+u on infinite trees. Personal Communication
Bojańczyk, M., Toruńczyk, S.: Deterministic automata and extensions of weak mso. In: FSTTCS, pp. 73–84 (2009)
Bojańczyk, M., Toruńczyk, S.: Weak MSO+U over infinite trees. In: STACS (2012)
Büchi, J.R.: On a decision method in restricted second order arithmetic. In: Proceedings of the International Congress on Logic, Methodology and Philosophy of Science, pp. 1–11. Stanford Univ. Press (1962)
Colcombet, T.: The theory of stabilisation monoids and regular cost functions. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009, Part II. LNCS, vol. 5556, pp. 139–150. Springer, Heidelberg (2009)
Colcombet, T.: Regular cost functions, part I: Logic and algebra over words. Logical Methods in Computer Science, 47 (2013)
Colcombet, T., Löding, C.: Regular cost functions over finite trees. In: LICS, pp. 70–79 (2010)
Flum, J., Ziegler, M.: Topological Model Theory, vol. 769. Springer (1980)
Gurevich, Y., Shelah, S.: Rabin’s uniformization problem. J. Symb. Log. 48(4), 1105–1119 (1983)
Hummel, S., Skrzypczak, M.: The topological complexity of mso+u and related automata models. Fundam. Inform. 119(1), 87–111 (2012)
Rabin, M.O.: Decidability of second-order theories and automata on infinite trees. Trans. Amer. Math. Soc. 141, 1–35 (1969)
Shelah, S.: The monadic theory of order. Annals of Math. 102, 379–419 (1975)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer-Verlag GmbH Berlin Heidelberg
About this paper
Cite this paper
Blumensath, A., Carton, O., Colcombet, T. (2014). Asymptotic Monadic Second-Order Logic. In: Csuhaj-Varjú, E., Dietzfelbinger, M., Ésik, Z. (eds) Mathematical Foundations of Computer Science 2014. MFCS 2014. Lecture Notes in Computer Science, vol 8634. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-44522-8_8
Download citation
DOI: https://doi.org/10.1007/978-3-662-44522-8_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-44521-1
Online ISBN: 978-3-662-44522-8
eBook Packages: Computer ScienceComputer Science (R0)