Demystifying $\mu$
Logic
2025-09-03 v6 Logic in Computer Science
Abstract
We explore the theory of illfounded and cyclic proofs for the propositional modal -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.
Cite
@article{arxiv.2401.01096,
title = {Demystifying $\mu$},
author = {Bahareh Afshari and Graham E. Leigh and Guillermo Menèndez Turata},
journal= {arXiv preprint arXiv:2401.01096},
year = {2025}
}