Confluent and Natural Cut Elimination in Classical Logic (original) (raw)
We show that, in deep inference, there is a natural and confluent cut elimination procedure that has a strikingly simple semantic justification. We proceed in two phases: we first tackle the propositional case with a construction that we call the 'experiments method'. Here we build a proof made of as many derivations as there are models of the given tautology. Then we lift the experiment method to the predicate calculus, by tracing all the existential witnesses, and in so doing we reconstruct the Herbrand theorem. The confluence of the procedure is essentially taken care of by the commutativity and associativity of disjunction.
Related papers
Cuts and Cut-Elimination for Complementary Classical Logic
This paper introduces LK, a cut-free sequent calculus able to faithfully characterize classical (propositional) non-theorems, in the sense that a formula α is provable in LK if, and only if, α is not provable in LK (i.e. α is not a tautology) [Tiomkin(1988), Bonatti(1993)]. This calculus is enriched with a set of admissible cut rules, which provide a cut-elimination algorithm. The calculus is also proved to be strong normalizing and strongly confluent.
Cut elimination in the presence of axioms
Abstract. A way is found to add axioms to sequent calculi that maintains the eliminability of cut, through the representation of axioms as rules of inference of a suitable form. By this method, the structural analysis of proofs is extended from pure logic to free-variable theories, covering all classical theories, and a wide class of constructive theories. All results are proved for systems in which also the rules of weakening and contraction can be eliminated.
A Natural Proof System for Herbrand's Theorem
The reduction of undecidable first-order logic to decidable propositional logic via Herbrand's theorem has long been of interest to theoretical computer science, with the notion of a Herbrand proof motivating the definition of expansion proofs. The problem of building a natural proof system around expansion proofs, with composition of proofs and cut-free completeness, has been approached from a variety of different angles. In this paper we construct a simple deep inference system for first-order logic, KSh2, based around the notion of expansion proofs, as a starting point to developing a rich proof theory around this foundation. Translations between proofs in this system and expansion proofs are given, retaining much of the structure in each direction.
Loading Preview
Sorry, preview is currently unavailable. You can download the paper by clicking the button above.