Abstract
As explained in Chap. 9, mso+u logic is an extension of mso that allows to express quantitative properties of structures. One of the consequences of the big expressive power of mso+u is that many decision problems about other quantitative formalisms can be reduced to mso+u. An example is the reduction [CL08] of the non-deterministic index problem to a certain boundedness problem that can be further reduced to mso+u on infinite trees. Therefore, decidability of mso+u would be a very desirable result.
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
Notes
- 1.
Except for the case if zfc is not consistent and it is possible to prove everything in zfc.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2016 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Skrzypczak, M. (2016). Undecidability of mso+u . In: Descriptive Set Theoretic Methods in Automata Theory. Lecture Notes in Computer Science(), vol 9802. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-52947-8_10
Download citation
DOI: https://doi.org/10.1007/978-3-662-52947-8_10
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-52946-1
Online ISBN: 978-3-662-52947-8
eBook Packages: Computer ScienceComputer Science (R0)