Decidability of Quantum Modal Logic
Logic in Computer Science
2026-03-20 v1 Logic
Abstract
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.
Cite
@article{arxiv.2603.18368,
title = {Decidability of Quantum Modal Logic},
author = {Kenji Tokuo},
journal= {arXiv preprint arXiv:2603.18368},
year = {2026}
}