Decidability of Quantum Modal Logic
arXiv:2603.18368 · doi:10.1093/jigpal/jzaf010
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.