Demystifying $μ$
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866908512905330688 |
|---|---|
| author | Afshari, Bahareh Leigh, Graham E. Turata, Guillermo Menèndez |
| author_facet | Afshari, Bahareh Leigh, Graham E. Turata, Guillermo Menèndez |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2401_01096 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Demystifying $μ$ Afshari, Bahareh Leigh, Graham E. Turata, Guillermo Menèndez Logic Logic in Computer Science 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. |
| title | Demystifying $μ$ |
| topic | Logic Logic in Computer Science |
| url | https://arxiv.org/abs/2401.01096 |