On modal \(\mu\)-calculus and non-well-founded set theory

DOI10.1023/B:LOGI.0000036771.59434.71zbMath1068.03021OpenAlexW2028537264MaRDI QIDQ1771199

Vincenzo Salipante, Luca Alberucci

Publication date: 7 April 2005

Published in: Journal of Philosophical Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/b:logi.0000036771.59434.71

zbMATH Keywords

bisimulationtransition systemsalternating tree automatamodal \(\mu\)-calculusnon-well-founded sets

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Modal logic (including the logic of norms) (03B45) Logic in computer science (03B70) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Nonclassical and second-order set theories (03E70)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Results on the propositional \(\mu\)-calculus
• An automata theoretic decision procedure for the propositional mu- calculus
• Fixed point characterization of infinite behavior of finite-state systems
• A lattice-theoretical fixpoint theorem and its applications
• Strictness of the Modal μ-Calculus Hierarchy
• STS: a structural theory of sets
• A system of axiomatic set theory - Part VII
• Alternating tree automata, parity games, and modal \(\mu\)-calculus

This page was built for publication: On modal \(\mu\)-calculus and non-well-founded set theory