Hostname: page-component-cd9895bd7-8ctnn Total loading time: 0 Render date: 2024-12-25T18:46:23.295Z Has data issue: false hasContentIssue false

A selection theorem

Published online by Cambridge University Press:  12 March 2014

Lefteris Miltiades Kirousis*
Affiliation:
University of Patras, Patras, Greece

Extract

In [1978] Harrington and MacQueen proved that if B is an (A, E)-semirecursive subset of A, such that the functions in BA can be coded as elements of A in an (A, E)-recursive way, then ENV(A, E) is closed under the existential quantifier ∃TB.

Later Moschovakis showed that if ENV(Vκ, ∈, E) is closed under the quantifier ∃tλ, where λ is the p-cofinality of κ, then

the p-cofinality of κ is the least ordinal λ for which there exists a (κ, <, E)-recursive partial function ƒ into κ, such that ƒ∣λ is total from λ onto an unbounded subset of κ.

In this paper we prove that for any infinite ordinal κ if p-card(κ) = κ, then ENV(κ, <, E) is closed under ∃tμ, for μ < p-cf(κ); p-cf(κ) is the “boldface” analog of p-cf((κ) and p-card(κ) is defined similarly.

From this follows that for any infinite ordinal κ the following two statements are equivalent.

(i) ENV(κ, <, E) is closed under bounded existential quantification.

(ii) ENV(κ, <, E) = ENV(κ, <, E#) or p-cf(κ) = κ.

We also show that we cannot omit any of the hypotheses in the above theorem.

We follow mainly the notation of Kechris and Moschovakis [1977].

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 1983

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

[1968] Boolos, G. and Putnam, H., Degrees of unsolvability of constructible sets of integers, this Journal, vol. 33 (1968), pp. 497513.Google Scholar
[1974] Devlin, K.J., An introduction to the fine structure of the constructible hierarchy (results of Ronald Jensen), Generalized recursion theory (Fenstad, J.E. and Hinman, P.G., Editors), North-Holland, Amsterdam, 1974, pp. 123163.Google Scholar
[1976] Harrington, L.A. and MacQueen, D.B., Selection in abstract recursion theory, this Journal, vol. 41 (1976), pp. 153158.Google Scholar
[1977] Kechris, A.S. and Moschovakis, Y.N., Recursion in higher types, Handbook of mathematical logic (Barwise, J., Editor), North-Holland, Amsterdam, 1977, pp. 681737.CrossRefGoogle Scholar
[1978] Normann, D., Set recursion, Generalized recursion theory. II (Fenstad, J.E.Gandy, R.O. and Sacks, G.E., Editors), North-Holland, Amsterdam, 1978, pp. 303320.Google Scholar