A lift of a theorem of Friedberg: A Banach-Mazur functional that coincides with no α-recursive functional on the class of α-recursive functions

Journal of Symbolic Logic 46 (2):216-232 (1981)
  Copy   BIBTEX

Abstract

R. M. Friedberg demonstrated the existence of a recursive functional that agrees with no Banach-Mazur functional on the class of recursive functions. In this paper Friedberg's result is generalized to both α-recursive functionals and weak α-recursive functionals for all admissible ordinals α such that $\lambda , where α * is the Σ 1 -projectum of α and λ is the Σ 2 -cofinality of α. The theorem is also established for the metarecursive case, α = ω 1 , where α * = λ = ω

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,386

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Accessible recursive functions.Stanley S. Wainer - 1999 - Bulletin of Symbolic Logic 5 (3):367-388.
Kleene index sets and functional m-degrees.Jeanleah Mohrherr - 1983 - Journal of Symbolic Logic 48 (3):829-840.
Some restrictions on simple fixed points of the integers.G. L. McColm - 1989 - Journal of Symbolic Logic 54 (4):1324-1345.
Hyper-Torre isols.Erik Ellentuck - 1981 - Journal of Symbolic Logic 46 (1):1-5.
Formal systems and recursive functions.John N. Crossley & Michael Dummett (eds.) - 1965 - Amsterdam,: North-Holland Pub. Co..

Analytics

Added to PP
2009-01-28

Downloads
30 (#519,519)

6 months
2 (#1,232,442)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Theory of Recursive Functions and Effective Computability.Hartley Rogers - 1971 - Journal of Symbolic Logic 36 (1):141-146.
The α-finite injury method.G. E. Sacks & S. G. Simpson - 1972 - Annals of Mathematical Logic 4 (4):343-367.
The alpha-finite injury method.G. E. Sacks - 1972 - Annals of Mathematical Logic 4 (4):343.
The recursively enumerable alpha-degrees are dense.Richard A. Shore - 1976 - Annals of Mathematical Logic 9 (1/2):123.

Add more references