Decidability of Quantum Modal Logic

TL;DR

This paper proves the decidability of quantum modal logic using Harrop's lemma, establishing that there is an algorithm to determine theoremhood in this logical system.

Contribution

It introduces a proof of decidability for quantum modal logic, a significant step in understanding its computational properties.

Findings

Decidability of quantum modal logic established.

Algorithmic approach for theorem determination in quantum modal logic.

Application of Harrop's lemma to quantum modal 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.