Linear Depth Deduction with Subformula Property for Intuitionistic Epistemic Logic

In their seminal paper Artemov and Protopopescu provide Hilbert formal systems, Brower–Heyting–Kolmogorov Kripke semantics for the logics of intuitionistic belief knowledge. Subsequently Krupski has proved that logic knowledge is PSPACE-complete Su Sano have provided calculi enjoying subformula property. This continues investigations around sequent Intuitionistic Epistemic Logics by providing property are terminating in linear depth. Our allow us to design a procedure invalid formulas returns model minimal Finally we also discuss refutational calculi, prove invalid.