An analytic calculus for intuitionistic belief
Cosimo Perini Brogi

TL;DR
This paper develops a natural deduction system for intuitionistic belief, proving its normalization, decidability, and key properties using proof-theoretic methods, thus advancing the formal understanding of intuitionistic epistemic logic.
Contribution
It introduces and analyzes a natural deduction calculus for intuitionistic belief, establishing normalization, subformula property, and other fundamental proof-theoretic results.
Findings
Normalization theorem proved for the calculus
Decidability and consistency established
Disjunction properties and reflection rule admissibility demonstrated
Abstract
Intuitionistic belief has been axiomatized by Artemov and Protopopescu as an extension of intuitionistic propositional logic by means of the distributivity scheme K, and of co-reflection . This way, belief is interpreted as a result of verification, and it fits an extended Brouwer-Heyting-Kolmogorov interpretation for intuitionistic propositional logic with an epistemic modality. In the present paper, structural properties of a natural deduction system for intuitionistic belief are investigated. The focus is on the analyticity of the calculus, so that the normalization theorem and the subformula property are proven firstly. From these, decidability and consistency of the logic follow as corollaries. Finally, disjunction properties, -primality, and admissibility of reflection rule are established by using purely proof-theoretic methods.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLogic, Reasoning, and Knowledge · Logic, programming, and type systems · AI-based Problem Solving and Planning
