Game semantics for the constructive $μ$-calculus
Fuente:
arXiv
Guardado en:
| Autor principal: | |
|---|---|
| Formato: | Preprint |
| Publicado: |
2023
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866912053580529664 |
|---|---|
| author | Pacheco, Leonardo |
| author_facet | Pacheco, Leonardo |
| contents | We define game semantics for the constructive $μ$-calculus and prove its equivalence to bi-relational semantics. As an application, we use the game semantics to prove that the $μ$-calculus collapses to modal logic over the modal logic $\mathsf{IS5}$. We then show the completeness of $\mathsf{IS5}$ extended with fixed-point operators. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2308_16697 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Game semantics for the constructive $μ$-calculus Pacheco, Leonardo Logic Logic in Computer Science 03B45 (Primary), 03F55, 03B62 (Secondary) We define game semantics for the constructive $μ$-calculus and prove its equivalence to bi-relational semantics. As an application, we use the game semantics to prove that the $μ$-calculus collapses to modal logic over the modal logic $\mathsf{IS5}$. We then show the completeness of $\mathsf{IS5}$ extended with fixed-point operators. |
| title | Game semantics for the constructive $μ$-calculus |
| topic | Logic Logic in Computer Science 03B45 (Primary), 03F55, 03B62 (Secondary) |
| url | https://arxiv.org/abs/2308.16697 |