A proof of strongly uniform termination for Gödel's T by methods from local predicativity

Archive for Mathematical Logic

Volumn 36, Issue 6, 1997, Pages 445-460

  Weiermann, Andreas ^a  

^a UNIVERSITY OF MÜNSTER   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0031285724     PISSN: 09335846     EISSN: None     Source Type: Journal    
DOI: 10.1007/s001530050075     Document Type: Article

References (46)

1. Ackermann, W.: Zur Widerspruchsfreiheit der Zahlentheorie. Mathematische Annalen 117, 162-194 (1940)
2. Arai, T.: A slow growing analogue to Buchholz' proof. Ann. Pure Appl. Logic 54, 101-120 (1991)
3. T. Arai: Variations on a theme by Weiermann. Preprint, Hiroshima (1996) (submitted)
4. Arai, T.: Consistency proof via pointwise induction. Preprint, Hiroshima (1996) (submitted)
5. Beckmann, A., Weiermann, A.: How to characterize the elementary recursive functions by Howard-Schütte style methods. Preprint Münster (1996) (submitted)
6. Buchholz, W.: Three contributions to the conference on recent advances in proof theory. Oxford (1980) (mimeographed)
7. 1 - CA) + BI. Ann. Pure Appl. Logic 33, 131-155 (1987)
8. Buchholz, W., Cichon, E.A., Weiermann, A.: A uniform approach to fundamental sequences and hierachies. Math. Logic Quart. 40, 273-286 (1994)
9. Diller, J.: Zur Berechenbarkeit primitiv-rekursiver Funktionale endlicher Typen. In: Schmitt, H.A., Schütte, K., Thiele, H.J. (eds.) Contributions to Mathematical Logic, pp. 109-120. Amsterdam: North-Holland 1968
10. Dragalin, A.G.: The computation of primitive recursive terms of finite type, and primitive recursive realization. Zap. Naucn. Dem. Leningrad. Otdel. Mat. Inst Steklov (LOM 1) 8, 32-35 (1968)
11. Gandy, R.: Proofs of strong normalization. In: Seldin, J.O., Hindley, J.R. (eds.) To H.B. Curry: Essays on Combinatory Logic, Lambda Calculus, and Formalism, pp. 457-477. New York: Academic Press 1980
12. Gentzen, G.:: Neue Fassung des Widerspruchsbeweises für die reine Zahlentheorie. Forschung in Logik und Grundlegung der exakten Wissenschaften N.S. 4, pp. 19-44. Leipzig: Hirzel 1938
13. 2-logic: Part I. Ann. Math. Logic 21, 75-219 (1981)
14. Girard, J.Y.: Proof Theory and Logical complexity II, (ca. 1980). Mimeographed (to appear)
15. Gödel, G.: Über eine bisher noch nicht benützte Erweiterung des finiten Standpunktes. Dialectica 12, 280-287 (1958)
16. Gödel, K.: K. Gödel Collected Works, Vol. III. In: Feferman, S. (ed.) Unpulished essays and lectures. Oxford: Oxford University Press 1995
17. Howard, W.: Assignment of ordinals to terms for primitive recursive functionals of finite type. Intuitionism and Proof Theory, pp. 443-458. Amsterdam: North-Holland 1970
18. Howard, W.: Ordinal analysis of bar recursion of type zero. Compositio Mathematica 42, 105-119 (1980).
19. Howard, W.: Ordinal analysis of terms of finite type. J. Symb. Logic 45, 493-504 (1980)
20. Howard, W.: Ordinal analysis of simple cases of bar recursion. J. Symb. Logic 46, 17-30 (1981)
21. G. Kreisel: On the interpretation of non-finitist proofs II. J. Symb. Logic 17, 43-58 (1952)
22. Leivant, D.: Predicative recurrence in finite type. In: Nerode, A., Matiyasevich, Y.V. (eds.) Logical Foundations of Computer Science. Springer Lecture Notes in Computer Science 813, 227-239 (1994). Berlin Heidelberg New York: Springer 1994
23. Prawitz, D.: Towards a foundation of general proof theory. Logic, Methodol. Philos. Sci. IV, 225-250 (1971)
24. Pohlers, W.: Proof theory and ordinal analysis. Arch. Math. Logic 30, 311-376 (1991)
25. Pohlers, W.: Pure proof theory: Aims methods and results. Preprint Münster (1995); Bull. Symb. Logic 2, 159-188 (1996)
26. Pohlers, W.: Pure proof theory: Aims methods and results. Preprint Münster (1995); Bull. Symb. Logic 2, 159-188 (1996)
27. Rose, H.E.: Subrecursion: Functions and Hierarchies. Oxford: Oxford University Press 1984
28. Sanchiz, L.E.: Functional defined by recursion. Notre Dame J. Form. Logic 8, 161-174 (1967)
29. Schmerl, U.: Number theory and the Bachmann-Howard ordinal. In: Stern, J. (ed.) Proceedings of the Herbrand Symposium, pp. 287-298. Amsterdam: North-Holland 1981
30. Schütte, K.: Proof Theory. Berlin Heidelberg New York: Springer 1977
31. 0-rekursiven Funktionen. Z. Math. Logik Grundl. Math. 17, 61-74 (1971)
32. Schwichtenberg, H.: Elimination of higher type levels in definitions of primitive recursive functionals by means of transfinite recursion. In: Rose. H.E.., Sheperdson, J.C. (eds.) Logic Colloquium '73, pp. 279-303. Amsterdam: North-Holland 1975
33. Schwichtenberg, H.: Proofs as programs. In: Aczel, P., Simmons, H., Wainer, S.S. (eds.) Proof Theory: A Selection of Papers from the Leeds Proof Theory Meeting 1990, pp. 81-113. Cambridge: Cambridge University Press 1993
34. Schwichtenberg, H. Wainer, S.S.: Ordinal bounds for programs. Preprint, München, Leeds (1994)
35. Schwichtenberg, H. van de Pol, J.: Strict functionals for termination proofs. Preprint, München (1994)
36. Shoenfield, J.R.: Mathematical Logic. New York: Addison-Wesley 1967
37. Tait, W.W.: Infinitely long terms of transfinite type. In: Crossley, J. Dummet, M.A.E. (eds.) Formal Systems and Recursive Functions, pp. 176-185. Amsterdam: North-Holland 1965
38. Tait, W.W.: Intensional Interpretations of functionals of finite type. J. Symb. Logic 32, 198-212 (1967)
39. Troelstra, A.S.: Metamathematical Investigations of Intuitionistic Arithmetic and Analysis. Second, corrected edition of LNM 344. ILLC Prepublication Series X-93-05 (1973)
40. Wainer, S.S.: A classification of the ordinal recursive functions. Arch. Math. Logik Grundlagenforsch. 13, 136-53 (1970)
41. Wainer, S.S.: Ordinal recursion and a refinement of the ordinal recursive functions. J. Symb. Logic 37, 281-292 (1972)
42. Weiermann, A.: Vereinfachte Kollabierungsfunktionen und ihre Anwendungen. Arch. Math. Logic 31, 85-94 (1991)
43. Weiermann, A.: How to characterize provably total functions by local predicativity. J. Symb. Logic 61, 52-69 (1996)
44. Weiermann, A.: Ein Beitrag zur Theorie der subrekursiven Funktionen. Habilitationsschrift, Münster (1994)
45. Weiermann, A.: Bounding derivation lengths with functions from the slow growing hierarchy. Preprint, Münster (1995) (submitted)
46. Weiermann, A., G. Wilken: Derivation lengths classifications for ≺-recursive functionals and systems of bar recursion of type 0. In preparation