On modal -calculus over reflexive symmetric graphs

DOI10.1093/LOGCOM/EXS028zbMath1276.03019OpenAlexW2136839729MaRDI QIDQ5300576

Giacomo Lenzi, Giovanna D'Agostino

Publication date: 27 June 2013

Published in: Journal of Logic and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/logcom/exs028

zbMATH Keywords

fixed pointsparity gamesmodal \(\mu\)-calculusfixpoint hierarchysymmetric and reflexive frames

Mathematics Subject Classification ID

Applications of game theory (91A80) Modal logic (including the logic of norms) (03B45) Logic in computer science (03B70)

Related Items (4)

The mu-calculus and Model Checking ⋮ The \(\mu\)-calculus alternation depth hierarchy is infinite over finite planar graphs ⋮ The alternation hierarchy of the \(\mu \)-calculus over weakly transitive frames ⋮ The \(\mu\)-calculus alternation hierarchy collapses over structures with restricted connectivity

This page was built for publication: On modal  -calculus over reflexive symmetric graphs