The modalμ-calculus hierarchy over restricted classes of transition systems
From MaRDI portal
Publication:3655261
DOI10.2178/jsl/1254748696zbMath1191.03012MaRDI QIDQ3655261
Alessandro Facchini, Luca Alberucci
Publication date: 7 January 2010
Published in: The Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://boris.unibe.ch/36791/1/S0022481200003200.pdf
03B45: Modal logic (including the logic of norms)
03B70: Logic in computer science
68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
05C57: Games on graphs (graph-theoretic aspects)
Related Items
$\aleph_1$ and the modal $\mu$-calculus, Free Heyting algebra endomorphisms: Ruitenburg’s Theorem and beyond, The \(\mu\)-calculus alternation hierarchy collapses over structures with restricted connectivity, On the \(\mu \)-calculus over transitive and finite transitive frames, Deciding the existence of uniform interpolants over transitive models, Modal characterisation theorems over special classes of frames, On modal \(\mu \)-calculus and Gödel-Löb logic, The \(\mu\)-calculus alternation depth hierarchy is infinite over finite planar graphs, Fixed-Point Elimination in the Intuitionistic Propositional Calculus, ON MODAL μ-CALCULUS OVER FINITE GRAPHS WITH SMALL COMPONENTS OR SMALL TREE WIDTH
Cites Work
- Unnamed Item
- Unnamed Item
- Results on the propositional \(\mu\)-calculus
- On modal \(\mu \)-calculus and Gödel-Löb logic
- A finite model theorem for the propositional \(\mu\)-calculus
- An automata theoretic decision procedure for the propositional mu- calculus
- The modal mu-calculus alternation hierarchy is strict
- Monadic second-order logic on tree-like structures
- Modal frame correspondences and fixed-points
- Processes, terms and cycles: steps on the road to infinity. Essays dedicated to Jan Willem Klop on the occasion of his 60th birthday
- A lattice-theoretical fixpoint theorem and its applications
