The modal -calculus hierarchy over restricted classes of transition systems
DOI10.2178/JSL/1254748696zbMATH Open1191.03012OpenAlexW2007304763MaRDI QIDQ3655261FDOQ3655261
Authors: Luca Alberucci, Alessandro Facchini 
Publication date: 7 January 2010
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://boris.unibe.ch/36791/1/S0022481200003200.pdf
Recommendations
Modal logic (including the logic of norms) (03B45) Games on graphs (graph-theoretic aspects) (05C57) Logic in computer science (03B70) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cites Work
- Title not available (Why is that?)
- A lattice-theoretical fixpoint theorem and its applications
- A finite model theorem for the propositional \(\mu\)-calculus
- Monadic second-order logic on tree-like structures
- Results on the propositional \(\mu\)-calculus
- An automata theoretic decision procedure for the propositional mu- calculus
- Modal frame correspondences and fixed-points
- The modal mu-calculus alternation hierarchy is strict
- Title not available (Why is that?)
- On modal \(\mu \)-calculus and Gödel-Löb logic
- Processes, terms and cycles: steps on the road to infinity. Essays dedicated to Jan Willem Klop on the occasion of his 60th birthday
Cited In (26)
- On modal \(\mu \)-calculus and Gödel-Löb logic
- Free Heyting algebra endomorphisms: Ruitenburg’s Theorem and beyond
- On modal \(\mu \)-calculus over finite graphs with small components or small tree width
- Deciding the first levels of the modal \(\mu\) alternation hierarchy by formula construction
- A linear translation from CTL\(^*\) to the first-order modal \(\mu \)-calculus
- Complexity results for modal logic with recursion via translations and tableaux
- On closure ordinals for the modal \(\mu\)-calculus
- \(\aleph_1\) and the modal \(\mu\)-calculus
- The \(\mu\)-calculus alternation depth hierarchy is infinite over finite planar graphs
- The alternation hierarchy of the \(\mu \)-calculus over weakly transitive frames
- The modal mu-calculus alternation hierarchy is strict
- Title not available (Why is that?)
- The arity hierarchy in the polyadic \(\mu\)-calculus
- Fixed-Point Elimination in the Intuitionistic Propositional Calculus
- The \(\mu\)-calculus alternation hierarchy collapses over structures with restricted connectivity
- The \(\mu\)-calculus alternation hierarchy collapses over structures with restricted connectivity
- Deciding the existence of uniform interpolants over transitive models
- On the \(\mu \)-calculus over transitive and finite transitive frames
- Justifying induction on modal \(\mu\)-formulae
- Modal characterisation theorems over special classes of frames
- On \(P\)-transitive graphs and applications
- Complexity through translations for modal logic with recursion
- A focus system for the alternation-free \(\mu \)-calculus
- Quantitative Modal Transition Systems
- Title not available (Why is that?)
- Strictness of the Modal μ-Calculus Hierarchy
This page was built for publication: The modal \(\mu \)-calculus hierarchy over restricted classes of transition systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3655261)
