Separating Graph Logic from MSO

DOI10.1007/978-3-642-00596-1_6zbMath1234.03022OpenAlexW1592461507WikidataQ58215572 ScholiaQ58215572MaRDI QIDQ3617721

Timos Antonopoulos, Anuj Dawar

Publication date: 31 March 2009

Published in: Foundations of Software Science and Computational Structures (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-00596-1_6

Mathematics Subject Classification ID

Automata and formal grammars in connection with logical questions (03D05)

Related Items (6)

Expressive Completeness of Separation Logic with Two Variables and No Separating Conjunction ⋮ Separation logics and modalities: a survey ⋮ On the almighty wand ⋮ An auxiliary logic on trees: on the tower-hardness of logics featuring reachability and submodel reasoning ⋮ On Temporal and Separation Logics ⋮ An auxiliary logic on trees: on the tower-hardness of logics featuring reachability and submodel reasoning

Cites Work

• Unnamed Item
• Expressiveness and complexity of graph logic
• A logical approach to asymptotic combinatorics. II: Monadic second-order properties
• On the Almighty Wand
• On the Expressive Power of Graph Logic
• FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
• Back and forth between guarded and modal logics

This page was built for publication: Separating Graph Logic from MSO