Boundedness of Monadic FO over Acyclic Structures

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.

• Type: Conference
• Year: 2007
• Where: ICALP
• Authors: Stephan Kreutzer, Martin Otto, Nicole Schweikardt
• Keywords: Decision Problem, ICALP 2007, Monadic fixed Points, Theoretical Computer Science, first-order Formulae