A simple ordinal recursive normalization of gödel’s T

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1414, Issue , 1998, Pages 491-509

  Voda, Paul J ^a  

^a Faculty of Natural Sciences   (Slovakia)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84957715619     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0028033     Document Type: Conference Paper

References (18)

1. R. S. Boyer and J. S. Moore. A Computational Logic. Academic Press, 1979.
2. W. Buchholz: Notation systems for infinitary derivations. Archive for Mathematical Logic, (30) pp. 277-296, 1991.
3. J. Y. Girard: Proofs and types, Cambridge University Press, 1989
4. K. Godel: Uber eirte bisher noch nicht benutzte Erweiterung des finiten Stand-punktes. Pp. 280-287, Dialectica 12 (1958).
5. A. Grzegorczyk: Some classes of recursive functions. Rozprawy Mate. No. IV, Warsaw 1953.
6. P. Hajek, P. Pudlak: Mathematics of first-order arithmetic. Springer Verlag 1993.
7. W. A. Howard: Assignment of ordinals to terms for primitive recursive functionals of finite type. In Intuitionism and Proof Theory, pp. 443-458, Amsterdamm 1970.
8. G.E. Mints: Finite investigations of transfinite derivations. Journal of Soviet Mathematics (10), pp. 548-596, 1978.
9. H. E. Rose: Subrecursion, Functions and Hierarchies. Clarendon Press, Oxford 1984.
10. J. R. Shoenfield: Mathematical logic. Addison Wesley, 1967.
11. K. Schutte: Proof Theory. Springer Verlag 1977.
12. H. Schwichtenberg: Elimination of higher type levels in definitions of primitive recursive functionals by means of transfinite recursion. In Logic Colloquium 1973 (eds. H. E. Rose and J. C. Shepherdson), North Holland, 1975.
13. H. Schwichtenberg: Classifying recursive functions. Handbook of Recursion Theory, to appear, 1996.
14. H. Schwichtenberg: Finite notations for infinite terms, to appear in APAL. Recursion Theory 96.
15. W. W. Tait: Nested recursion. Math. Ann. 143, pp. 236-250, 1961.
16. W. W. Tait: Infinitely long terms of transfinite type. In Formal systems and recursive functions (ed. J. N. Crossley and M. Dummett), pp. 176-185, North Holland 1967.
17. P. J. Voda: Subrecursion as a basis for a feasible programming language. In L. Pacholski and J. Tiuryn, editors, Proceedings of CSL’94, number 933 in LNCS, pages 324-338. Springer Verlag, 1994.
18. A. Weiermann: A proof of strongly uniform termination for Godel’s T by methods from local predicativity, to appear in Archives for Math. Logic, 1997