On modal mu-calculus and Büchi tree automata
From MaRDI portal
Publication:1349728
DOI10.1016/0020-0190(94)00227-PzbMATH Open1004.68530OpenAlexW2065408915MaRDI QIDQ1349728FDOQ1349728
Publication date: 27 February 1997
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(94)00227-p
Cites Work
- Results on the propositional \(\mu\)-calculus
- The greatest fixed-points and rational omega-tree languages
- Logical definability of fixed points
- SnS can be modally characterized
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (6)
- The modal mu-calculus alternation hierarchy is strict
- The \(\mu\)-calculus alternation hierarchy collapses over structures with restricted connectivity
- Bouncing threads for circular and non-wellfounded proofs. Towards compositionality with circular proofs
- The modal mu-calculus alternation hierarchy is strict
- Ambiguous classes in \(\mu\)-calculi hierarchies
- Title not available (Why is that?)
This page was built for publication: On modal mu-calculus and Büchi tree automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1349728)
