• Corpus ID: 232135223

Linear Depth Deduction with Subformula Property for Intuitionistic Epistemic Logic

  title={Linear Depth Deduction with Subformula Property for Intuitionistic Epistemic Logic},
  author={Guido Fiorino},
In their seminal paper Artemov and Protopopescu provide Hilbert formal systems, Brower-Heyting-Kolmogorov and Kripke semantics for the logics of intuitionistic belief and knowledge. Subsequently Krupski has proved that the logic of intuitionistic knowledge is PSPACE-complete and Su and Sano have provided calculi enjoying the subformula property. This paper continues the investigations around to sequent calculi for Intuitionistic Epistemic Logics by providing sequent calculi that have the… 

Figures from this paper

Constructive and Mechanised Meta-Theory of Intuitionistic Epistemic Logic
A constructive and mechanised completeness proof for IEL is presented, employing a syntactic decidability proof based on cut-elimination to constructivise the ideas from the literature and expect that it will extend to other modal logics.


Contraction-Free Linear Depth Sequent Calculi for Intuitionistic Propositional Logic with the Subformula Property and Minimal Depth Counter-Models
LSJ, a contraction-free sequent calculus for Intuitionistic propositional logic whose proofs are linearly bounded in the length of the formula to be proved and satisfy the subformula property is presented.
Sequent Calculus for Intuitionistic Epistemic Logic IEL
A cut-free sequent calculus is constructed for IEL and it is proved that polynomial space is sufficient for the proof search in it and that IEL is PSPACE-complete.
Nested Sequents for Intuitionistic Logics
It is noteworthy that the resulting system for constant domain intuitionistic logic is particularly simple, which amounts to a combination of intuitionistic propositional rules and classical quantifier rules, a combination that is known to be inadequate when conventional intuitionistic sequent systems are used.
First-Order Intuitionistic Epistemic Logic
The Hilbert systems and sequent calculi of the first-order expansion of these two intuitionistic epistemic logic systems are provided to be proved sound and complete for the intended semantics and the cut-elimination theorems of both systems are proved.
It is argued that on this view coreflection A → KA is valid and the factivity of knowledge holds in the form KA → ¬¬A ‘known propositions cannot be false’ and the knowability paradox is resolved in a constructive manner.
An Evaluation-Driven Decision Procedure for G3i
An evaluation-driven proof-search procedure that given a sequent σ returns either a G3i-derivation of σ or a countermodel for σ is described, and it is proved that such a procedure is terminating and correct, and that the depth of the G 3i-trees generated during proof search is quadratic in the size of ρ.
Bounds for cut elimination in intuitionistic propositional logic
This article shall construct a (different) cut free deduction J(d) for the case of intuitionistic propositional logic and derive considerably sharper upper bounds for l(J(d)), and use the methods developed for this purpose in order to set up an effective decision method.
Curry-Howard-Lambek Correspondence for Intuitionistic Belief
A natural deduction calculus for intuitionistic logic of belief is introduced which is easily turned into a modal $\lambda$-calculus giving a computational semantics for deductions in $\mathsf{IEL}^{-}$ and it is proved that it has good proof-theoretical properties.
Artëmov and Tudor Protopopescu . Intuitionistic epistemic logic
  • Rev . Symb . Log .
  • 2016
Modal type theory based on the intuitionistic modal logic IEL
  • Logical Foundations of Computer Science - International Symposium,
  • 2020