Some linear herbrand proof procedures : an analysis
نویسنده
چکیده
Several Herbrand proof procedures proposed during the 1960 decade are shown to be related in varying degrees. Most of the paper deals with a relationship between s-linear resolution and model elimination. Refinements of each are proposed and the spaces of ground deductions are shown to be isomorphic in a suitable sense. The two refined procedures are then studied at the general level where they are no longer isomorphic and do not always relate to a natural ground level counterpart. Other topics considered are the introduction of an added merge condition to model elimination and also an expanded possible use of lemmas. Finally, the model elimination procedure is interpreted in the linked conjunct procedure of Davis and the matrix reduction procedure of Prawitz. Some Linear Herbrand Proof Procedures: An Analysis
منابع مشابه
Herbrand Methods in Sequent Calculi: Unification in LL
We propose a reformulation of quantiiers rules in sequent calculi which allows to replace blind existential instantiation with uniication, thereby reducing non-determinism and complexity in proof-search. Our method, based on some ideas underlying the proof of Herbrand theorem for classical logic, may be applied to any \reasonable" non-classical sequent calculus, but here we focus on sequent cal...
متن کاملDescribing proofs by short tautologies
Herbrand’s theorem is one of the most fundamental results about first-order logic. In the context of proof analysis, Herbrand-disjunctions are used for describing the constructive content of cut-free proofs. However, given a proof with cuts, the computation of an Herbrand-disjunction is of significant computational complexity, as the cuts in the proof have to be eliminated first. In this paper ...
متن کاملReasoning Inside The Box: Deduction in Herbrand Logics
Herbrand structures are a subclass of standard first-order structures commonly used in logic and automated reasoning due to their strong definitional character. This paper is devoted to the logics induced by them: Herbrand and semi-Herbrand logics, with and without equality. The rich expressiveness of these logics entails that there is no adequate effective proof system for them. We therefore i...
متن کاملProof Search in the Intuitionistic Sequent Calculus
The use of Herbrand functions (sometimes called Skolemization) plays an important role in classical theorem proving and logic programming. We define a notion of Herbrand functions for the full intuitionistic predicate calculus. This definition is based on the view that the proof-theoretic role of Herbrand functions (to replace universal quantifiers), and of unification (to find instances corres...
متن کاملApplications of Proof Interpretations
In this thesis, the author describes the research carried out during his PhDstudies. The results presented in this thesis have previously been published in a number of papers([38, 40, 42, 39, 41]). The subject of the author’s research is the development of general, proof-theoretic methods for the extraction of effective realizers and bounds from formal (possibly ineffective) proofs in mathemati...
متن کامل