2000 character limit reached
Demystifying $μ$ (2401.01096v3)
Published 2 Jan 2024 in math.LO and cs.LO
Abstract: We explore the theory of illfounded and cyclic proofs for the propositional modal $\mu$-calculus. A fine analysis of provability for classical and intuitionistic modal logic provides a novel bridge between finitary, cyclic and illfounded conceptions of proof and re-enforces the importance of two normal form theorems for the logic: guardedness and disjunctiveness.