Hostname: page-component-7c8c6479df-ws8qp Total loading time: 0 Render date: 2024-03-19T07:58:59.458Z Has data issue: false hasContentIssue false

On bar recursion of types 0 and 1

Published online by Cambridge University Press:  12 March 2014

Helmut Schwichtenberg*
Affiliation:
Mathematisches Institut der Universität, d-8000 München 2, Federal Republic of Germany

Extract

For general information on bar recursion the reader should consult the papers of Spector [8], where it was introduced, Howard [2] and Tait [11]. In this note we shall prove that the terms of Gödel's theory T(in its extensional version of Spector [8]) are closed under the rule BR0,1 of bar recursion of types 0 and 1. Our method of proof is based on the notion of an infinite term introduced by Tait [9]. The main tools of the proof are (i) the normalization theorem for (notations for) infinite terms and (ii) valuation functionals. Both are elaborated in [6]; for brevity some familiarity with this paper is assumed here. Using (i) and (ii) we reduce BR0,1 to ξ-recursion with ξ < ε0. From this the result follows by work of Tait [10], who gave a reduction of 2ξ-recursion to ξ-recursion at a higher type. At the end of the paper we discuss a perhaps more natural variant of bar recursion introduced by Kreisel in [4].

Related results are due to Kreisel (in his appendix to [8]), who obtains results which imply, using the reduction given by Howard [2] of the constant of bar recursion of type τ to the rule of bar recursion of type (0 → τ) → τ, that T is not closed under the rule of bar recursion of a type of level ≥ 2, to Diller [1], who gave a reduction of BR0,1 to ξ-recursion with ξ bounded by the least ω-critical number, and to Howard [3], who gave an ordinal analysis of the constant of bar recursion of type 0. I am grateful to H. Barendregt, W. Howard and G. Kreisel for many useful comments and discussions.

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 1979

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

REFERENCES

[1]Diller, J., Zur Theorie rekursiver Funktionale höherer Typen, Habilitationsschrift, München, 1968.Google Scholar
[2]Howard, W. A., Functional interpretation of bar induction by bar recursion, Compositio Mathematica, vol. 20(1968), pp. 107124.Google Scholar
[3]Howard, W. A., Ordinal analysis of bar recursion of type zero, 1970 (unpublished).Google Scholar
[4]Kreisel, G., Review of the paper “The model G of the theory BR” by Ersov, , Zentralblatt für Mathematik und ihre Grenzgebiete, vol. 312(1976), 02034.Google Scholar
[5]Schwichtenberg, H., Einige Anwendungen von unendlichen Termen und Werifunktionalen, Habilitationsschrift, Münster, 1973.Google Scholar
[6]Schwichtenberg, H., Elimination of higher type levels in definitions of primitive recursive functionals by means of transfinite recursion, Logic Colloquium '73 (Rose, H. E. and Shepherdson, J. C., Editors), North-Holland, Amsterdam, 1975, pp. 279303.Google Scholar
[7]Schwichtenberg, H., Proof theory: Some applications of cut elimination, Handbook of mathematical logic (Barwise, J., Editor), North-Holland, Amsterdam, 1977, pp. 867895.CrossRefGoogle Scholar
[8]Spector, C., Provably recursive functionals of analysis: A consistency proof of analysis by an extension of principles formulated in current intuitionistic mathematics, Recursive function theory (Dekker, J., Editor), American Mathematical Society, Providence, RI, 1962, pp. 127.Google Scholar
[9]Tait, W. W., Infinitely long terms of transfinite type, Formal systems and recursive functions (Crossley, J. N. and Dummet, M. A. E., Editors), North-Holland, Amsterdam, 1965, pp. 176185.CrossRefGoogle Scholar
[10]Tait, W. W., Constructive reasoning, Logic, methodology and the philosophy of science. III (van Rootselaar, B. and Staal, J. F., Editors), North-Holland, Amsterdam, 1976, pp. 185–19Google Scholar
[11]Tait, W. W., Normal form theorem for bar recursive functions of finite type, Proceeding of the Second Scandinavian Logic Symposium (Fenstad, J.E., Editor), North-Holland, Amsterdam, 1971, pp. 352367.Google Scholar
[12]Troelstra, A. S., Matetamathematical investigation of intuitionistic arithmetic and analysis, Springer, Berlin, 1973.CrossRefGoogle Scholar