A First-Order Expansion of Artemov and Protopopescu's Intuitionistic Epistemic Logic

被引:0
|
作者
Su, Youan [1 ]
Sano, Katsuhiko [1 ]
机构
[1] Hokkaido Univ, Fac Humanities & Human Sci, Nishi 7 Chome,Kita 10 Jo,Kita Ku, Sapporo, Hokkaido 0600810, Japan
关键词
Intuitionistic logic; Epistemic logic; Sequent calculus; Geometric implication; Cut elimination; BHK interpretation; CUT ELIMINATION;
D O I
10.1007/s11225-023-10037-6
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
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 superset of KA) in terms of the Brouwer-Heyting-Kolmogorov interpretation. There are two variants of intuitionistic epistemic logic: one with the axiom "KA superset of (sic)(sic)A" and one without it. The former is called IEL, and the latter is called 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).
引用
收藏
页码:615 / 652
页数:38
相关论文
共 50 条
  • [31] The First-Order Logic of Hyperproperties
    Finkbeiner, Bernd
    Zimmermann, Martin
    34TH SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE (STACS 2017), 2017, 66
  • [32] COMPUTING WITH FIRST-ORDER LOGIC
    ABITEBOUL, S
    VIANU, V
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1995, 50 (02) : 309 - 335
  • [33] Wright's First-Order Logic of Strict Finitism
    Yamada, Takahiro
    STUDIA LOGICA, 2024,
  • [34] A First-order Logic with Frames
    Murali, Adithya
    Pena, Lucas
    Loeding, Christof
    Madhusudan, P.
    ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS, 2023, 45 (02):
  • [35] Indistinguishability and first-order logic
    Jordan, Skip
    Zeugmann, Thomas
    THEORY AND APPLICATIONS OF MODELS OF COMPUTATION, PROCEEDINGS, 2008, 4978 : 94 - 104
  • [36] First-Order Logic Formalisation of Arrow's Theorem
    Grandi, Umberto
    Endriss, Ulle
    LOGIC, RATIONALITY, AND INTERACTION, PROCEEDINGS, 2009, 5834 : 133 - 146
  • [37] From separation logic to first-order logic
    Calcagno, C
    Gardner, P
    Hague, M
    FOUNDATIONS OF SOFTWARE SCIENCE AND COMPUTATION STRUCTURES, PROCEEDINGS, 2005, 3441 : 395 - 409
  • [38] From First-Order Logic to Assertional Logic
    Zhou, Yi
    ARTIFICIAL GENERAL INTELLIGENCE: 10TH INTERNATIONAL CONFERENCE, AGI 2017, 2017, 10414 : 87 - 97
  • [39] Decidability Results in First-Order Epistemic Planning
    Liberman, Andres Occhipinti
    Rendsvig, Rasmus Kraemmer
    PROCEEDINGS OF THE TWENTY-NINTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2020, : 4161 - 4167
  • [40] Intuitionistic completeness for first order classical logic
    Berardi, S
    JOURNAL OF SYMBOLIC LOGIC, 1999, 64 (01) : 304 - 312