Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/springer-journals/on-the-form-of-witness-terms-0ejBP3nLYd
References (50)
-
Christian Urban (2000)
Classical Logic and Computation -
Wenhui Zhang (1991)
Cut Elimination and Automatic Proof ProceduresTheor. Comput. Sci., 91
-
M. Baaz, Stefan Hetzl, A. Leitsch, C. Richter, H. Spohr (2008)
CERES: An analysis of Fürstenberg's proof of the infinity of primesTheor. Comput. Sci., 403
-
G. Kreisel (1982)
Finiteness Theorems in Arithmetic: An Application of Herbrand's Theorem For Σ2 - FormulasStudies in logic and the foundations of mathematics, 107
-
V.P. Orevkov (1979)
Lower bounds for increasing complexity of derivations after cut eliminationZapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta, 88
-
D. Miller (1987)
A compact representation of proofsStudia Logica, 46
-
P. Pudlák (1998)
Chapter VIII - The Lengths of ProofsStudies in logic and the foundations of mathematics, 137
-
D. Hilbert, P. Bernays (1934)
Grundlagen der Mathematik -
H. Comon (1997)
Tree automata techniques and applications -
Wenhui Zhang (1994)
Depth of Proofs, Depth of Cut-Formulas and Complexity of Cut FormulasTheor. Comput. Sci., 129
-
D. Ratiu, T. Trifonov (2012)
Exploring the Computational Content of the Infinite Pigeonhole PrincipleJ. Log. Comput., 22
-
Richard McKinley (2008)
Herbrand expansion proofs and proof identity -
S. Buss (1998)
Handbook of proof theory -
F. Gécseg, M. Steinby (1997)
Handbook of Formal Languages, vol 3. -
Marianna Girlando, Sonia Marin, Y. Cai, Nathan Guermond, Abhiram Kothapalli, Selene Arévalo, Youning Xia (2010)
Introduction to Proof Theory -
M. Baaz, Stefan Hetzl (2011)
On the non-confluence of cut-eliminationThe Journal of Symbolic Logic, 76
-
M. Baaz, A. Leitsch (1994)
On Skolemization and Proof ComplexityFundam. Informaticae, 20
-
M. Baaz, A. Leitsch (2000)
Cut-elimination and Redundancy-elimination by ResolutionJ. Symb. Comput., 29
-
P. Gerhardy (2003)
Refined Complexity Analysis of Cut Elimination -
P. Gerhardy (2003)
The Role of Quantifier Alternations in Cut EliminationNotre Dame J. Formal Log., 46
-
U. Kohlenbach (2008)
Applied Proof Theory - Proof Interpretations and their Use in Mathematics -
P. Curien, Hugo Herbelin (2000)
The duality of computation -
V. Orevkov (1982)
Lower bounds for increasing complexity of derivations after cut eliminationJournal of Soviet Mathematics, 20
-
(1958)
Über eine noch nicht benützte -
H. Edwards (1977)
Fermat's Last Theorem: A Genetic Introduction to Algebraic Number Theory -
Stefan Hetzl (2009)
Describing proofs by short tautologiesAnn. Pure Appl. Log., 159
-
R. Statman (1979)
Lower bounds on Herbrand’s theorem, 75
-
S. Buss (1998)
Chapter I - An Introduction to Proof TheoryStudies in logic and the foundations of mathematics, 137
-
Polynomiale Anzahlschranken (1989)
Herbrand-Analysen zweier Beweise des Satzes von Roth: Polynomiale AnzahlschrankenJournal of Symbolic Logic, 54
-
H. Schwichtenberg (1977)
Proof Theory: Some Applications of Cut-EliminationStudies in logic and the foundations of mathematics, 90
-
V. Danos, J. Joinet, H. Schellinx (1997)
A new deconstructive logic: linear logicJournal of Symbolic Logic, 62
-
D. Prawitz (1965)
Natural Deduction: A Proof-Theoretical Study -
F. Gécseg, M. Steinby (1997)
Tree Languages -
J. Gallier (1993)
Constructive Logics Part I: A Tutorial on Proof Systems and Typed gamma-CalculiTheor. Comput. Sci., 110
-
M. Baaz, Stefan Hetzl, A. Leitsch, C. Richter, H. Spohr (2005)
Cut-Elimination: Experiments with CERES -
Alessandra Carbone (1999)
Turning Cycles into SpiralsAnn. Pure Appl. Log., 96
-
J. Girard (1989)
Proof Theory and Logical ComplexityAnnals of Pure and Applied Logic, 53
-
G. Takeuti (1975)
Proof Theory -
G. Gentzen (1936)
Die Widerspruchsfreiheit der reinen ZahlentheorieMathematische Annalen, 112
-
J. Zucker (1974)
The correspondence between cut-elimination and normalization IIAnnals of Mathematical Logic, 7
-
A. Carbone (1999)
Cycling in proofs and feasibilityTransactions of the American Mathematical Society, 352
-
W. Tait (1968)
Normal derivability in classical logic -
Christian Urban, G. Bierman (1999)
Strong Normalisation of Cut-Elimination in Classical Logic -
V. Gödel (1958)
ÜBER EINE BISHER NOCH NICHT BENÜTZTE ERWEITERUNG DES FINITEN STANDPUNKTESDialectica, 12
-
G. Gentzen (1935)
Untersuchungen über das logische Schließen. IMathematische Zeitschrift, 39
-
S Buss (1998)
Handbook of proof theory pages -
S. Hetzl -
C. Parry (1981)
Review: Harold M. Edwards, Fermat's last theorem, a genetic introduction to algebraic number theory, and Paulo Ribenboim, 13 Lectures on Fermat's last theoremBulletin of the American Mathematical Society, 4
-
J. Barwise, H. Keisler (1977)
Handbook of mathematical logicThe British Journal for the Philosophy of Science, 30
-
(2008)
Proof Forests with Cut-Elimination Based on Herbrand’s Theorem
- Publisher
- Springer Journals
- Copyright
- Copyright © 2010 by Springer-Verlag
- Subject
- Mathematics; Algebra; Mathematics, general; Mathematical Logic and Foundations
- ISSN
- 0933-5846
- eISSN
- 1432-0665
- DOI
- 10.1007/s00153-010-0186-7
- Publisher site
- See Article on Publisher Site
Abstract
We investigate the development of terms during cut-elimination in first-order logic and Peano arithmetic for proofs of existential formulas. The form of witness terms in cut-free proofs is characterized in terms of structured combinations of basic substitutions. Based on this result, a regular tree grammar computing witness terms is given and a class of proofs is shown to have only elementary cut-elimination.
Journal
Archive for Mathematical Logic – Springer Journals
Published: Apr 26, 2010