Decidability results for the boundedness problem

DOI10.2168/LMCS-10(3:2)2014zbMATH Open1337.03019arXiv1406.7684OpenAlexW2140885135MaRDI QIDQ2878748FDOQ2878748

Authors: Achim Blumensath, Martin Otto, Mark Weyer 

Publication date: 5 September 2014

Published in: Logical Methods in Computer Science (Search for Journal in Brave)

Abstract: 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.

Full work available at URL: https://arxiv.org/abs/1406.7684

Recommendations

• Boundedness of Monadic FO over Acyclic Structures
• The complexity of boundedness for guarded logics
• Monadic second order finite satisfiability and unbounded tree-width
• Guarded fixed point logics and the monadic theory of countable trees.
• An Extension of Muchnik's Theorem

zbMATH Keywords

boundednessfixed pointsmonadic second-order logic

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Automata and formal grammars in connection with logical questions (03D05) Decidability of theories and sets of sentences (03B25)

Cited In (17)

• A unified approach to boundedness properties in MSO
• Title not available (Why is that?)
• Some new decidability results on positive and negative set constraints
• Title not available (Why is that?)
• Lower bounds for some decision problems over \(C\)
• Decidability, partial decidability and sharpness relation for L-subsets
• Title not available (Why is that?)
• Resolution of the uniform lower bound problem in constructive analysis
• On the complexity of decision using destinies in \(H\)-bounded structures
• Boundedness of Monadic FO over Acyclic Structures
• On undecidability bounds for matrix decision problems
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A more general theory of static approximations for conjunctive queries
• A more general theory of static approximations for conjunctive queries
• Trading bounds for memory in games with counters

This page was built for publication: Decidability results for the boundedness problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2878748)