Monadic Second Order Logic And Its Fragments
From MaRDI portal
Publication:4923546
DOI10.1016/S1571-0661(04)80208-1zbMath1263.03007OpenAlexW2079799494MaRDI QIDQ4923546
Publication date: 24 May 2013
Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s1571-0661(04)80208-1
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Results on the propositional \(\mu\)-calculus
- The closure of monadic NP
- A lattice-theoretical fixpoint theorem and its applications
- Mu-depth 3 is more than 2: a game-theoretic proof
- Theμ-calculus alternation-depth hierarchy is strict on binary trees
- Decidability of Second-Order Theories and Automata on Infinite Trees
- On the expressive completeness of the propositional mu-calculus with respect to monadic second order logic
This page was built for publication: Monadic Second Order Logic And Its Fragments