Decidability of Quantum Modal Logic
Fuente:
arXiv
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2026
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866915874097594368 |
|---|---|
| author | Tokuo, Kenji |
| author_facet | Tokuo, Kenji |
| contents | The decidability of a logical system refers to the existence of an algorithm that can determine whether any given formula in that system is a theorem. In this paper, Harrop's lemma is used to prove the decidability of quantum modal logic. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2603_18368 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Decidability of Quantum Modal Logic Tokuo, Kenji Logic in Computer Science Logic The decidability of a logical system refers to the existence of an algorithm that can determine whether any given formula in that system is a theorem. In this paper, Harrop's lemma is used to prove the decidability of quantum modal logic. |
| title | Decidability of Quantum Modal Logic |
| topic | Logic in Computer Science Logic |
| url | https://arxiv.org/abs/2603.18368 |