Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/springer-journals/a-proof-of-strongly-uniform-termination-for-g-del-s-t-by-methods-from-vkCOPaZmoE
References (39)
-
A. Weiermann (1998)
Bounding derivation lengths with functions from the slow growing hierarchyArchive for Mathematical Logic, 37
-
T. Arai (1998)
Variations on a theme by WeiermannJournal of Symbolic Logic, 63
-
H. Schwichtenberg (1993)
Proofs as programs -
W. Howard (1980)
Ordinal analysis of terms of finite typeJournal of Symbolic Logic, 45
-
A. Nerode, M. Taitslin (1992)
Logical Foundations of Computer Science — Tver '92, 620
-
W. Howard (1970)
Assignment of Ordinals to Terms for Primitive Recursive Functionals of Finite TypeStudies in logic and the foundations of mathematics, 60
-
(1995)
Gödel Collected Works, Vol. III. In: Feferman, S. (ed.) Unpulished essays and lectures -
T. Arai (1998)
Consistency proof via pointwise inductionArchive for Mathematical Logic, 37
-
G. Kreisel (1951)
On the interpretation of non-finitist proofs—Part IJournal of Symbolic Logic, 16
-
J. Girard (1989)
Proof Theory and Logical ComplexityAnnals of Pure and Applied Logic, 53
-
W. Tait (1967)
Intensional interpretations of functionals of finite type IJournal of Symbolic Logic, 32
-
(1968)
The computation of primitive recursive terms of finite type, and primitive recursive realization -
D. Prawitz (1973)
Towards A Foundation of A General Proof TheoryStudies in logic and the foundations of mathematics, 74
-
W. Tait (1965)
Infinitely Long Terms of Transfinite TypeStudies in logic and the foundations of mathematics, 40
-
H. Schwichtenberg (1971)
Eine Klassifikation der e0-rekursiven FunktionenMathematical Logic Quarterly, 17
-
H. Rose (1984)
Subrecursion: Functions and Hierarchies -
H. Schwichtenberg, S. Wainer (1995)
Ordinal Bounds for Programs -
W. Ackermann (1940)
Zur Widerspruchsfreiheit der ZahlentheorieMathematische Annalen, 117
-
T. Arai (1991)
A Slow Growing Analogue to Buchholz' ProofAnn. Pure Appl. Log., 54
-
Andreas Weiermann (1991)
Vereinfachte Kollabierungsfunktionen und ihre AnwendungenArchive for Mathematical Logic, 31
-
A. Cichon, W. Buchholz, A. Weiermann (1994)
A Uniform Approach to Fundamental Sequences and HierarchiesMath. Log. Q., 40
-
W. Howard (1981)
Ordinal analysis of simple cases of bar recursionJournal of Symbolic Logic, 46
-
(1981)
Π 12logic : Part I -
(1996)
How to characterize the elementary recursive functions by Howard-Scḧutte style methods -
J. Diller (1968)
Zur Berechenbarkeit Primitiv-Rekursiver Funktionale Endlicher TypenStudies in logic and the foundations of mathematics, 50
-
Ulf Schmerl (1982)
Number Theory and the Bachmann/Howard OrdinalStudies in logic and the foundations of mathematics, 107
-
(1980)
Proofs of strong normalization -
V. Gödel (1958)
ÜBER EINE BISHER NOCH NICHT BENÜTZTE ERWEITERUNG DES FINITEN STANDPUNKTESDialectica, 12
-
A. Troelstra (1973)
Metamathematical investigation of intuitionistic arithmetic and analysis -
L. Sanchis (1967)
Functionals defined by recursionNotre Dame J. Formal Log., 8
-
S. Wainer (1970)
A classification of the ordinal recursive functionsArchiv für mathematische Logik und Grundlagenforschung, 13
-
W. Pohlers (1991)
Proof theory and ordinal analysisArchive for Mathematical Logic, 30
-
W. Pohlers (1996)
Pure Proof Theory Aims, Methods and Results: Extended Version of Talks Given at Oberwolfach and HaifaBulletin of Symbolic Logic, 2
-
(1980)
Three contributions to the conference on recent advances in proof theory -
J. Pol, H. Schwichtenberg (1995)
Strict Functionals for Termination Proofs -
A. Weiermann (1996)
How to characterize provably total functions by local predicativityJournal of Symbolic Logic, 61
-
D. Leivant (1994)
Predicative Recurrence in Finite Types -
H. Schwichtenberg (1975)
Elimination of higher type levels in definitions of primitive recursive functionals -
W. Buchholz (1987)
An independence result for (II11-CA)+BIAnn. Pure Appl. Log., 33
- Publisher
- Springer Journals
- Copyright
- Copyright © 1997 by Springer-Verlag Berlin Heidelberg
- Subject
- Mathematics; Mathematical Logic and Foundations; Mathematics, general; Algebra
- ISSN
- 0933-5846
- eISSN
- 1432-0665
- DOI
- 10.1007/s001530050075
- Publisher site
- See Article on Publisher Site
Abstract
We estimate the derivation lengths of functionals in Gödel's system $T$ of primitive recursive functionals of finite type by a purely recursion-theoretic analysis of Schütte's 1977 exposition of Howard's weak normalization proof for $T$ . By using collapsing techniques from Pohlers' local predicativity approach to proof theory and based on the Buchholz-Cichon and Weiermann 1994 approach to subrecursive hierarchies we define a collapsing f unction ${\cal D}:T\to \omega$ so that for (closed) terms $a,b$ of Gödel's $T$ we have: If $a$ reduces to $b$ then $\omega>{\cal D}(a)>{\cal D}(b).$ By one uniform proof we obtain as corollaries: A derivation lengths classification for functionals in $T$ , hence new proof of strongly uniform termination of $T$ . A new proof of the Kreisel's classific ation of the number-theoretic functions which can be defined in $T$ , hence a classification of the provably total functions of Peano Arithmetic. A new proof of Tait's results on weak normalization for $T$ . A new proof of Troelstra's result on strong normalization for $T$ . Additionally, a slow growing analysis of Gödel's $T$ is obtained via Girard's hierarchy comparison theorem. This analyis yields a contribution to two open pro blems posed by Girard in part two of his book on proof theory. For the sake of completeness we also mention the Howard Schütte bound on derivation lengths for the simple typed $\lambda$ -calculus.
Journal
Archive for Mathematical Logic – Springer Journals
Published: Oct 1, 1997