Intuitionistic μ-Calculus with the Lewis Arrow
| Authors |
|
|---|---|
| Publication date | 2026 |
| Host editors |
|
| Book title | Automated Reasoning with Analytic Tableaux and Related Methods |
| Book subtitle | 34th International Conference, TABLEAUX 2025, Reykjavik, Iceland, September 27–29, 2025 : proceedings |
| ISBN |
|
| ISBN (electronic) |
|
| Series | Lecture Notes in Computer Science |
| Event | 34th International Conference on Automated Reasoning with Analytic Tableaux and Related Methods, TABLEAUX 2025 |
| Pages (from-to) | 374-392 |
| Publisher | Cham: Springer |
| Organisations |
|
| Abstract | We present an intuitionistic counterpart of the modal μ-calculus formulated with the binary Lewis arrow, a generalisation of the □-operator. Using Ruitenburg’s theorem, we prove that every formula is equivalent to a guarded one. We then provide a sound and complete non-wellfounded proof system for the logic that is cut-free, and obtain as a corollary that the logic is decidable and admits a cyclic proof system. A game semantics for the logic is developed which acts as a mediator between the formal proof system and the relational semantics. |
| Document type | Conference contribution |
| Language | English |
| Published at |
https://doi.org/10.1007/978-3-032-06085-3_20
(Final published version)
|
| Downloads |
978-3-032-06085-3_20
(Final published version)
|
| Permalink to this page | |
