The Caucal hierarchy: interpretations in the (W)MSO+\(\mathsf{U}\) logic

DOI10.1016/j.ic.2021.104782OpenAlexW3174829447MaRDI QIDQ2672657

Paweł Parys

Publication date: 13 June 2022

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2021.104782

zbMATH Keywords

boundednessCaucal hierarchyMSO+\(\mathsf{U}\)

Mathematics Subject Classification ID

Automata and formal grammars in connection with logical questions (03D05) Decidability of theories and sets of sentences (03B25)

Related Items (1)

Special issue: Selected papers of the 13th international conference on language and automata theory and applications, LATA 2019

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Weak MSO with the unbounding quantifier
• Iterated stack automata and complexity classes
• The monadic theory of order
• Monadic second-order logic, graph coverings and unfoldings of transition systems
• Monadic second-order definable graph transductions: a survey
• Monadic second-order logic on tree-like structures
• Extensions of the Caucal hierarchy?
• Rewriting higher-order stack trees
• On the Significance of the Collapse Operation
• A Type System Describing Unboundedness
• Monadic theory of order and topology in ZFC
• Variants of Collapsible Pushdown Systems
• Composition with Algebra at the Background
• FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
• Transforming structures by set interpretations
• Computer Science Logic
• A Combinatorial Theorem for Trees

This page was built for publication: The Caucal hierarchy: interpretations in the (W)MSO+\(\mathsf{U}\) logic