Result: Unwinding a non-effective cut elimination proof
Title:
Unwinding a non-effective cut elimination proof
Authors:
Source:
Computer science (theory and applications)0CSR 2006. :259-269
Publisher Information:
Berlin: Springer, 2006.
Publication Year:
2006
Physical Description:
print, 13 ref 1
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Informatique théorique, Theoretical computing, Algorithmique. Calculabilité. Arithmétique ordinateur, Algorithmics. Computability. Computer arithmetics, Arbre recherche, Search tree, Arbol investigación, Déroulement, Unwinding, Desenrrollamiento, Elimination coupure, Cut elimination, Eliminación corte, Modélisation, Modeling, Modelización, Ramification, Branching, Ramificación, Théorème Herbrand, Herbrand theorem, Teorema Herbrand
Document Type:
Conference
Conference Paper
File Description:
text
Language:
English
Author Affiliations:
Stanford University, Stanford Ca 94305, United States
ISSN:
0302-9743
Rights:
Copyright 2007 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems
Accession Number:
edscal.19150253
Database:
PASCAL Archive
Further Information
Non-effective cut elimination proof uses Koenig's lemma to obtain a non-closed branch of a proof-search tree T (without cut) for a first order formula A, if A is not cut free provable. A partial model (semi-valuation) corresponding to this branch and verifying ¬A is extended to a total model for ¬A using arithmetical comprehension. This contradicts soundness, if A is derivable with cut. Hence T is a cut free proof of A. The same argument works for Herbrand Theorem. We discuss algorithms of obtaining cut free proofs corresponding to this schema and quite different from complete search through all possible proofs.