Abstract
We study the boundedness problem for monadic least fixed points as a decision problem. While this problem is known to be undecidable in general and even for syntactically very restricted classes of underlying first-order formulae, we here obtain a decidability result for the boundedness issue for monadic fixed points over arbitrary first-order formulae in restriction to acyclic structures. © Springer-Verlag Berlin Heidelberg 2007.
Cite
CITATION STYLE
Kreutzer, S., Otto, M., & Schweikardt, N. (2007). Boundedness of monadic FO over acyclic structures. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4596 LNCS, pp. 571–582). Springer Verlag. https://doi.org/10.1007/978-3-540-73420-8_50
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
