Hostname: page-component-586b7cd67f-r5fsc Total loading time: 0 Render date: 2024-11-29T01:21:05.196Z Has data issue: false hasContentIssue false

Almost local non-α-recursiveness

Published online by Cambridge University Press:  12 March 2014

Chi T. Chong*
Affiliation:
Yale University, New Haven, Connecticut 06520

Extract

§1. Let α be an admissible ordinal which is also a limit of admissible ordinals (e.g. take any α such that α = α*, its projectum [5]). For any admissible γα, let [γ) denote the initial segment of ordinals less than γ. A very general question that one might ask is the following: What conditions should one put on γ so that a certain statement true in Lα is ‘reflected’ to be true in Lγ? We cite some examples: (a) If β < γ < α, then Lα ⊨ “β cardinal” is ‘reflected’ to Lγ ⊨ “ β cardinal” (⊨ is just the satisfaction relation). (b) If β < γ < α and γ is a cardinal in Lα (called α-cardinal for short), then Lα ⊨ “β is not a cardinal” is ‘reflected’ to Lγ ⊨ “β is not a cardinal” This fact is used in Gödel's proof that V = L implies the Generalized Continuum Hypothesis. Our objective in this paper is to study a ‘reflection’ property of the following sort: Let A ⊆ [α) be an α-recursively enumerable (α-r.e.), non-α-recursive set. Under what conditions will A restricted to a smaller admissible ordinal γ be γ-r.e. and not γ-recursive?

The notations used here are standard. Those that are not explained are adopted from the paper of Sacks and Simpson [5], to which we also refer the reader for background material.

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 1974

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

BIBLIOGRAPHY

[1]Jensen, R. B., The fine structure of the constructible universe, Annals of Mathematical Logic, vol. 4 (1972), pp. 229308.CrossRefGoogle Scholar
[2]Lerman, M., Maximal α-r.e. sets, Transactions of the American Mathematical Society, vol. 188 (1974), pp. 341386.Google Scholar
[3]Lerman, M. and Simpson, S., Maximal sets in α-recursion theory, Israel Journal of Mathematics, vol. 14 (1973), pp. 236247.CrossRefGoogle Scholar
[4]Lévy, A., A hierarchy of formulas in set theory, Memoirs of the American Mathematical Society, No. 57, 1965.Google Scholar
[5]Sacks, G. E. and Simpson, S., The α-finite injury method, Annals of Mathematical Logic, vol. 4 (1972), pp. 343367.CrossRefGoogle Scholar
[6]Soare, R. and Jockusch, C., Degrees of members of Π10 classes, Pacific Journal of Mathematics, vol. 40 (1972), pp. 605616.Google Scholar