Artemov and Protopopescu introduced a Brouwer-Heyting-Kolmogorov interpretation of knowledge operator to define the intuitionistic epistemic logic IEL, where the axiom A⊃KA\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$A\supset KA$$\end{document} is accepted but the axiom KA⊃A\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$KA\supset A$$\end{document} is refused. This paper studies the notion of distributed knowledge on an expansion of the multi agent variant of IEL. We provide a BHK interpretation of distributed knowledge operator to define the intuitionistic epistemic (...) logic with distributed knowledge DIEL. We construct Hilbert system and cut-free sequent calculus for DIEL\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathbf {DIEL}$$\end{document} and show that they are sound and complete for the intended Kripke semantics. (shrink)

Intuitionistic epistemic logic by Artemov and Protopopescu (Rev Symb Log 9:266–298, 2016) accepts the axiom “if A, then A is known” (written $$A \supset K A$$ ) in terms of the Brouwer–Heyting–Kolmogorov interpretation. There are two variants of intuitionistic epistemic logic: one with the axiom “ $$KA \supset \lnot \lnot A$$ ” and one without it. The former is called $$\textbf{IEL}$$, and the latter is called $$\textbf{IEL}^{-}$$. The aim of this paper is to study first-order expansions (with equality and function (...) symbols) of these two intuitionistic epistemic logics. We define Hilbert systems with additional axioms called geometric axioms and sequent calculi with the corresponding rules to geometric axioms and prove that they are sound and complete for the intended semantics. We also prove the cut-elimination theorems for both sequent calculi. As a consequence, the disjunction property and existence property are established for the sequent calculi without geometric implications. Finally, we establish that our sequent calculi can also be formulated with admissible structural rules (i.e., in terms of a G3-style sequent calculus). (shrink)