Abstract
In this paper a new proof of the strong normalization theorem (SN) for barrecursive terms is presented.
The proof is based on a syntactical version of Howard's compactness of functionals of finite type (see [T, 2.8.6]). The proofs of Tait [Ta], Luckhardt [L], and Vogel [V] are all based on continuity. These proofs use “infinite terms”: ifT 0,T 1, ... is an infinite sequence of terms of type σ, then 〈T 0,T 1, ...〉 is an infinite term of type (0)σ. The proof below does not make use of infinite terms.
Similar content being viewed by others
References
Bezem, M.: Strongly majorizable functionals of finite type: a model for barrecursion containing discontinuous functionals. J. Symb. Logic50, 652–660 (1985).
Gödel, K.: Über eine bisher noch nicht benützte Erweiterung des finiten Standpunktes, Dialectica12, 280–287 (1958)
Luckhardt, H.: Extensional Gödel functional interpretation. Springer Lecture Notes in Mathematics 306, Berlin, Heidelberg, New York: 1973.
Spector, C.: Provably recursive functionals of analysis: a consistency proof of analysis by an extension of principles formulated in current intuitionistic mathematics. In: Dekker, J.C.E. (ed.): Proc. Symp. Pure Mathematics V. American Mathematical Society, Providence, RI (1962).
Tait, W.W.: Normal form theorem for barrecursive functions of finite type, in: Proceedings of the 2nd Scandinavian Logic Symposium. Amsterdam: North-Holland 1971.
Troelstra, A.S., (ed.): Metamathematical investigation of intuitionistic arithmetic and analysis. Springer Lecture Notes in Mathematics 344. Berlin, Heidelberg, New York: Springer 1973.
Vogel, H.: Ein starker Normalisationssatz für die barrekursiven Funktionale. Arch. math. Logik18, 81–84 (1976).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Bezem, M. Strong normalization of barrecursive terms without using infinite terms. Arch math Logik 25, 175–181 (1985). https://doi.org/10.1007/BF02007566
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02007566