Affiliation:
1. Department of Computer Science, University of Bath, Bath, Somerset, UK
Abstract
Abstract
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. In this paper we construct simple deep inference systems for first-order logic, both with and without cut, such that ‘decomposed’ proofs—proofs where the contractive and non-contractive behaviour of the proof is separated—in each system correspond to either expansion proofs or Herbrand proofs. Translations between proofs in this system, expansion proofs and Herbrand proofs are given, retaining much of the structure in each direction.
Publisher
Oxford University Press (OUP)
Subject
Logic,Hardware and Architecture,Arts and Humanities (miscellaneous),Software,Theoretical Computer Science
Reference37 articles.
1. Unsound Inference Make Proofs Shorter;Aguilera;The Journal of Symbolic Logic,2019
2. The True Concurrency of Herbrand’s Theorem;Alcolei,2018
3. Subatomic Proof Systems: Splittable Systems;Tubella;ACM Transactions on Computational Logic,2018
4. Removing Cycles from Proofs;Tubella,2017