Abstract
One of the strongest decidability results in logic is the theorem of Muchnik which allows one to transfer the decidability of the monadic second-order theory of a structure to the decidability of the MSO-theory of its iteration, a tree built of disjoint copies of the original structure. We present a generalization of Muchnik's result to stronger logics, namely guarded second-order logic and its extensions by counting quantifiers. We also establish a strong equivalence result between monadic least fixed-point logic (M-LFP) and MSO on trees by showing that whenever M-LFP and MSO coincide on a structure they also coincide on its iteration.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
