Hostname: page-component-cd9895bd7-hc48f Total loading time: 0 Render date: 2024-12-25T19:41:18.261Z Has data issue: false hasContentIssue false
  • English
  • Français

α-Degrees of maximal α-r.e. sets

Published online by Cambridge University Press:  12 March 2014

Anne Leggett
Anne Leggett*
Affiliation:
University of Texas, Austin, Texas 78712
Get access Rights & Permissions [Opens in a new window]

Extract

Martin [10] has computed the degrees of several classes of ω-r.e. sets. Lachlan [3] and Shoenfield [14] have obtained some additional results. For most of the examples, a class of r.e. sets is given by a property that is first-order definable over the lattice of ω-r.e. sets. Then the set of degrees of sets in this class is computed. The only sets of nonzero degrees which arise from the known examples are the following: ϕ, {a∣a is ω-r.e. and a ≠ 0}, {a∣a is ω-r.e. and a′ = 0″}, and {a∣a is ω-r.e. and a″ > 0″} (see [14]).

There have been some results in this direction for α an arbitrary admissible ordinal. Sacks [13] has shown that every nonzero α-r.e. α-degree contains a regular α-r.e. set. Thus regularity does not separate the α-r.e. α-degrees. Simpson [18] has several theorems which give information about the kinds of α-r.e. sets a given α-degree can contain. The classes of α-r.e. sets considered do separate the α-r.e. α-degrees into two nonempty pieces for some α's, but they are not necessarily given by properties which are definable over the lattice of α-r.e. sets. Using some definability results of Lerman [6], we shall make some comments about the definability of these classes of sets.

Type
Research Article
Information
The Journal of Symbolic Logic , Volume 43 , Issue 3 , September 1978 , pp. 456 - 474
Copyright
Copyright © Association for Symbolic Logic 1978

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]Chong, C.T. and Lerman, M., Hyperhypersimple α-r.e. sets, Annals of Mathematical Logic, vol. 9 (1976), pp. 1–48.CrossRefGoogle Scholar
[2]Kreisel, G. and Sacks, G. E., Metarecursive sets, this Journal, vol. 30 (1965), pp. 318–338.Google Scholar
[3]Lachlan, A. H., Degrees of recursively enumerable sets which have no maximal supersets, this Journal, vol. 33 (1968), pp. 431–443.Google Scholar
[4]Leggett, A., Maximal α-r.e. sets and their complements, Annals of Mathematical Logic, vol. 6 (1974), pp. 293–357.CrossRefGoogle Scholar
[5]Leggett, A. and Shore, R. A., Types of simple α-recursively enumerable sets, this Journal, vol. 41 (1976), pp. 681–694.Google Scholar
[6]Lerman, M., Congruence relations, filters, ideals, and definability in lattices of α-recursively enumerable sets, this Journal, vol. 41 (1976), pp. 405–418.Google Scholar
[7]Lerman, M., Maximal α-r.e. sets, Transactions of the American Mathematical Society, vol. 188 (1974), pp. 341–386.Google Scholar
[8]Lerman, M., On elementary theories of some lattices of α-recursively enumerable sets (to appear).Google Scholar
[9]Lerman, M. and Simpson, S., Maximal sets in α-recursion theory, Israel Journal of Mathematics, vol. 14 (1973), pp. 236–247.CrossRefGoogle Scholar
[10]Martin, D. A., Classes of recursively enumerable sets and degrees of unsolvability, Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 12 (1966), pp. 295–310.CrossRefGoogle Scholar
[11]Owings, J. C. Jr., Recursion, metarecursion, and inclusion, this Journal, vol. 32 (1967), pp. 173–179.Google Scholar
[12]Sacks, G. E., Degrees of unsolvability, Annals of Mathematics Studies, no. 55, Princeton University Press, Princeton, 1966.Google Scholar
[13]Sacks, G. E., Post's problem, admissible ordinals, and regularity, Transactions of the American Mathematical Society, vol. 124 (1966), pp. 1–23.Google Scholar
[14]Shoenfield, J. R., Degrees of classes of RE sets, this Journal, vol. 41 (1976), pp. 695–696.Google Scholar
[15]Shoenfield, J. R., Degrees of unsolvability, North-Holland, Amsterdam, 1971.Google Scholar
[16]Shore, R.A., On the jump of an α-recursively enumerable set, Transactions of the American Mathematical Society, vol. 217 (1976), pp. 351–363.Google Scholar
[17]Shore, R.A., Some more minimal pairs of α-recursively enumerable degrees (to appear).Google Scholar
[18]Simpson, S. G., Admissible ordinals and recursion theory, Ph.D. dissertation, Massachusetts Institute of Technology, 1971.Google Scholar
[19]Simpson, S. G., Degree theory on admissible ordinals, Generalized Recursion Theory, Proceedings of the Oslo Symposium (Fenstad, J. E. and Hinman, P. G., Editors), North-Holland, Amsterdam, 1974, pp. 165–194.CrossRefGoogle Scholar
[20]Simpson, S. G., Recursion theory on admissible ordinals, Perspectives in Mathematical Logic, Springer-Verlag (in preparation).Google Scholar
[21]Yates, C. E. M., Three theorems on the degree of recursively enumerable sets, Duke Mathematical Journal, vol. 32 (1965), pp. 461–468.CrossRefGoogle Scholar