Trees over infinite structures and path logics with synchronization

MaRDI QIDQ4965866zbMATH OpenFDO

Authors Alex Spelten, Wolfgang Thomas, Sarah Winter

Publication date 10 March 2021

Full work available at URL https://arxiv.org/abs/1111.3107, http://eptcs.web.cse.unsw.edu.au/paper.cgi?INFINITY2011.5

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• The Monadic Theory of Tree-like Structures
• Mathematical Foundations of Computer Science 2003
• Path logics with synchronization
• Weak MSO+U with path quantifiers over infinite trees
• Weak \(\text{MSO}+U\) over infinite trees

Cited in

(6)

• Finite automata over infinite alphabets: two models with transitions for local change
• The Monadic Theory of Tree-like Structures
• Finite automata over infinite alphabets: two models with transitions for local change
• Solving Infinite Games in the Baire Space
• Hyper partial order logic
• Path logics with synchronization

This page was built for publication: Trees over infinite structures and path logics with synchronization

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