Sequent Calculus for Intuitionistic Epistemic Logic

2015/08/31 by Krupski, Vladimir N., Yatmanov, Alexey
#FOS: Computer and information sciences #Logic in Computer Science (cs.LO)

paper · doi:10.48550/arxiv.1508.07851

Abstract

The formal system of intuitionistic epistemic logic IEL was proposed by S. Artemov and T. Protopopescu. It provides the formal foundation for the study of knowledge from an intuitionistic point of view based on Brouwer-Hayting-Kolmogorov semantics of intuitionism. We construct a cut-free sequent calculus for IEL and establish that polynomial space is sufficient for the proof search in it. So, we prove that IEL is PSPACE-complete.

Related

• Linear Depth Deduction with Subformula Property for Intuitionistic Epistemic Logic
• Modality Definition Synthesis for Epistemic Intuitionistic Logic via a Theorem Prover
• First-Order Intuitionistic Logic with Decidable Propositional Atoms
• Proof Theory for Intuitionistic Strong Löb Logic
• Proof search in multi-succedent sequent calculi for intuitionistic logic under the Schuette's schema