Decidability Results for the Boundedness Problem

We prove decidability of the boundedness problem for monadic least fixed-point recursion based on positive monadic second-order (MSO) formulae over trees. Given an MSO-formula phi(X,x) that is positive in X, it is decidable whether the fixed-point recursion based on phi is spurious over the class of all trees in the sense that there is some uniform finite bound for the number of iterations phi takes to reach its least fixed point, uniformly across all trees. We also identify the exact complexity of this problem. The proof uses automata-theoretic techniques. This key result extends, by means of model-theoretic interpretations, to show decidability of the boundedness problem for MSO and guarded second-order logic (GSO) over the classes of structures of fixed finite tree-width. Further model-theoretic transfer arguments allow us to derive major known decidability results for boundedness for fragments of first-order logic as well as new ones.

[1]  Yiannis N. Moschovakis,et al.  Global inductive definability , 1978, Journal of Symbolic Logic.

[2]  Bruno Courcelle,et al.  The monadic second-order logic of graphs XIV: uniformly sparse graphs and edge set quantifications , 2003, Theor. Comput. Sci..

[3]  Harry G. Mairson,et al.  Undecidable optimization problems for database logic programs , 1993, JACM.

[4]  Valentin Goranko,et al.  Model theory of modal logic , 2007, Handbook of Modal Logic.

[5]  Erich Grädel,et al.  On the Restraining Power of Guards , 1999, Journal of Symbolic Logic.

[6]  D. Harel.  Recurring dominoes: making the highly undecidable highly understandable , 1985 .

[7]  Stephan Kreutzer,et al.  Boundedness of Monadic FO over Acyclic Structures , 2007, ICALP.

[8]  J.F.A.K. van Benthem,et al.  Modal logic and classical logic , 1983 .

[9]  Igor Walukiewicz.  Monadic second-order logic on tree-like structures , 2002, Theor. Comput. Sci..

[10]  Klaus Reinhardt,et al.  The Complexity of Translating Logic to Finite Automata , 2001, Automata, Logics, and Infinite Games.

[11]  Achim Blumensath.  Guarded Second-Order Logic, Spanning Trees, and Network Flows , 2010, Log. Methods Comput. Sci..

[12]  Johan van Benthem,et al.  Modal Languages and Bounded Fragments of Predicate Logic , 1998, J. Philos. Log..

[13]  Bruno Courcelle,et al.  A Logical Characterization of the Sets of Hypergraphs Defined by Hyperedge Replacement Grammars , 1995, Math. Syst. Theory.

[14]  Yuri Gurevich,et al.  The Classical Decision Problem , 1997, Perspectives in Mathematical Logic.

[15]  Y. Gurevich.  On Finite Model Theory , 1990 .

[16]  Haim Gaifman,et al.  Decidable optimization problems for database logic programs , 1988, STOC '88.

[17]  Stephan Kreutzer,et al.  Model Theory Makes Formulas Large , 2007, ICALP.

[18]  Christof Löding,et al.  The Nesting-Depth of Disjunctive µ-Calculus for Tree Languages and the Limitedness Problem , 2008, CSL.

[19]  Igor Walukiewicz,et al.  Guarded fixed point logic , 1999, Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158).

[20]  Michael Vanden Boom,et al.  Weak cost automata over infinite trees , 2012 .

[21]  Martin Otto,et al.  The Boundedness Problem for Monadic Universal First-Order Logic , 2006, 21st Annual IEEE Symposium on Logic in Computer Science (LICS'06).

[22]  Harry G. Mairson,et al.  Undecidable Boundedness Problems for Datalog Programs , 1995, J. Log. Program..

[23]  Igor Walukiewicz,et al.  On the Expressive Completeness of the Propositional mu-Calculus with Respect to Monadic Second Order Logic , 1996, CONCUR.

[24]  Martin Otto.  Eliminating Recursion in the µ-Calculus , 1999, STACS.

[25]  Martin Otto,et al.  Back and forth between guarded and modal logics , 2000, Proceedings Fifteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.99CB36332).