Labeled Sequent Calculus for Orthologic
Keywords:quantum logic, sequent calculus, cut-elimination theorem, decidability, Kripke model
Orthologic (OL) is non-classical logic and has been studied as a part of quantumlogic. OL is based on an ortholattice and is also called minimal quantum logic. Sequent calculus is used as a tool for proof in logic and has been examinedfor several decades. Although there are many studies on sequent calculus forOL, these sequent calculi have some problems. In particular, they do not includeimplication connective and they are mostly incompatible with the cut-eliminationtheorem. In this paper, we introduce new labeled sequent calculus called LGOI, and show that this sequent calculus solve the above problems. It is alreadyknown that OL is decidable. We prove that decidability is preserved when theimplication connective is added to OL.
C. Faggian and G. Sambin, From Basic Logic to Quantum Logics with Cut-Elimination, International Journal of Theoretical Physics 37(1) (1998), pp. 31–37.
G. M. Hardegree, Material Implication in Orthomodular (and Boolean) Lattices, Notre Dame Journal of Formal Logic 22(2) (1981), pp. 163–182.
Z. Hou, A. Tiu and R. Gore, A Labelled Sequent Calculus for BBI: Proof Theory and Proof Search, TABLEAUX 2013 (2013), pp. 172–187.
How to Cite
This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.