Hostname: page-component-cd9895bd7-p9bg8 Total loading time: 0 Render date: 2024-12-23T23:30:10.588Z Has data issue: false hasContentIssue false
  • English
  • Français

On the upper semi-lattice of -degrees

Published online by Cambridge University Press:  22 January 2016

Juichi Shinoda
Juichi Shinoda*
Affiliation:
Department of Mathematics, Faculty of Science, Nagoya University
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

S. C. Kleene developed the theory of recursive functionals of finite types in Kleene [5]. He proved that a set A of natural numbers is recursive in E if and only if A is hyperarithmetical, where E is the type 2 object defined by

Type
Research Article
Information
Nagoya Mathematical Journal , Volume 80 , December 1980 , pp. 75 - 106
Copyright
Copyright © Editorial Board of Nagoya Mathematical Journal 1980

References

[ 1 ] Aczel, P. and Hinman, P. G., Recursion in the superjump, in : Generalized Recursion Theory, edited by Fenstad, J. E. and Hinman, P. G. (North-Holland, Amsterdam, 1974), 3–41.Google Scholar
[ 2 ] Barwise, J., Admissible Sets and Structures, Springer, Berlin, 1975.CrossRefGoogle Scholar
[ 3 ] Gandy, R. O. and Sacks, G. E., A minimal hyperdegree, Fund. Math. 61 (1967), 215–223.CrossRefGoogle Scholar
[ 4 ] Hinman, P. G., Recursion-Theoretic Hierarchies, Springer, Berlin, 1978.CrossRefGoogle Scholar
[ 5 ] Kleene, S. C., Recursive functionals and quantifiers of finite type I, Trans. Amer. Math. Soc. 91 (1959), 1–52.Google Scholar
[ 6 ] Platek, R., A countable hierarchy for the superjump, in : Logic Colloquium ’69, edited by Gandy, R. O. and Yates, C. E. M. (North-Holland, Amsterdam, 1971), 257–271.Google Scholar
[ 7 ] Richter, W., Constructive transfinite number classes, Bull. Amer. Math. Soc. 73 (1967), 261–265.CrossRefGoogle Scholar
[ 8 ] Sacks, G. E., Forcing with perfect closed sets, Proc. Sympos. Pure Math., vol. 13, part I, Amer. Math. Soc, Providence, R. I., 1971, 331–355.CrossRefGoogle Scholar
[ 9 ] Sacks, G. E., Countable admissible ordinals and hyperdegrees, Advances in Math. 19 (1976), 213–262.CrossRefGoogle Scholar
[10] Shoenfield, J. R., A hierarchy based on a type 2 object, Trans. Amer. Math. Soc. 134 (1968), 103–108.CrossRefGoogle Scholar
[11] Solovay, R. M., A model of set theory in which every set of reals is Lebesgue measurable, Ann. Math. 92 (1970), 1–56.CrossRefGoogle Scholar
[12] Spector, C., On degrees of recursively unsolvability, Ann. Math. 64 (1956), 581–592.CrossRefGoogle Scholar
[13] Tugué, T., Predicates recursive in a type-2 object and Kleene hierarchies, Comment. Math. Univ. St Paul 8 (1959), 97–117.Google Scholar