Ceres in intuitionistic logic

0533996 - ÚI 2021 NL eng J - Článek v odborném periodiku
Cerna, David M. - Leitsch, A. - Reis, G. - Wolfsteiner, S.
Ceres in intuitionistic logic.
Annals of Pure and Applied Logic. Roč. 168, č. 10 (2017), s. 1783-1836. ISSN 0168-0072. E-ISSN 1873-2461
Klíčová slova: cut-elimination * Cut-elimination * Intuitionistic logic * ceres * Proof resolution
Impakt faktor: 1.000, rok: 2017

In this paper we present a procedure allowing the extension of a CERES-based cut-elimination method to intuitionistic logic. Previous results concerning this problem manage to capture fragments of intuitionistic logic, but in many essential cases structural constraints were violated during normal form construction resulting in a classical proof. The heart of the CERES method is the resolution calculus, which ignores the structural constraints of the well known intuitionistic sequent calculi. We propose, as a method of avoiding the structural violations, the generalization of resolution from the resolving of clauses to the resolving of cut-free proofs, in other words, what we call proof resolution. The result of proof resolution is a cut-free proof rather than a clause. Note that resolution on ground clauses is essentially atomic cut, thus using proof resolution to construct cut-free proofs one would need to join the two proofs together and remove the atoms which where resolved. To efficiently perform this joining (and guarantee that the resulting cut-free proof is intuitionistic) we develop the concept of proof subsumption (similar to clause subsumption) and indexed resolution, a refinement indexing atoms by their corresponding positions in the cut formula. Proof subsumption serves as a tool to prove the completeness of the new method CERES-i, and indexed resolution provides an efficient strategy for the joining of two proofs which is in general a nondeterministic search. Such a refinement is essential for any attempt to implement this method. Finally we compare the complexity of CERES-i with that of Gentzen-based methods.
Trvalý link: http://hdl.handle.net/11104/0312218