Hostname: page-component-848d4c4894-xfwgj Total loading time: 0 Render date: 2024-06-25T03:00:22.886Z Has data issue: false hasContentIssue false
  • English
  • Français

Measure-theoretic construction of incomparable hyperdegrees

Published online by Cambridge University Press:  12 March 2014

Clifford Spector
Clifford Spector*
Affiliation:
The Ohio State University
Get access Rights & Permissions [Opens in a new window]

Extract

Kleene-Post [10], Spector [14] and Friedberg [3, 4], have given a number of examples of functions which have incomparable degrees of recursive unsolvability satisfying various additional conditions. Our present purpose is to determine to what extent some of these incomparability theorems can be generalized by substituting for “α. is recursive in β” other relations Q(α, β) such as “α is hyperarithmetical in β” (which we shall think of as “α ≦ β”), and to determine what restrictions, if any, need be imposed on Q. As a consequence of our investigation we shall show that there are incomparable hyperdegrees as defined in [9] and [13].

Type
Research Article
Information
The Journal of Symbolic Logic , Volume 23 , Issue 3 , September 1958 , pp. 280 - 288
Copyright
Copyright © Association for Symbolic Logic 1958

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]Addison, J. W., Hierarchies and the axiom of constructibility, mimeographed Summaries of talks presented at the Summer Institute of Symbolic Logic in 1957 at Cornell University, pp. 355–362.Google Scholar
[2]Addison, J. W. and Kleene, S. C., A note on function quantification, Proceedings of the American Mathematical Society, vol. 8 (1957), pp. 1002–1006.CrossRefGoogle Scholar
[3]Friedberg, Richard M., Two recursively enumerable sets of incomparable degrees of unsolvability (solution of Post's problem, 1944), Proceedings of the National Academy of Sciences, vol. 43 (1957), pp. 236–238.CrossRefGoogle ScholarPubMed
[4]Friedberg, Richard M., A criterion for completeness of degrees of unsolvability, this Journal, vol. 22 (1957), pp. 159–160.Google Scholar
[5]Gödel, Kurt, The consistency of the axiom of choice and of the generalized continuum hypothesis, Proceedings of the National Academy of Sciences, vol. 24 (1938), pp. 556–557.CrossRefGoogle ScholarPubMed
[6]Halmos, Paul R., Measure theory, Van Nostrand, 1950, xi + 304 pp.CrossRefGoogle Scholar
[7]Kleene, S. C., Introduction to metamathematics, New York and Toronto (Van Nostrand), Amsterdam (North-Holland Publishing Company), and Groningen (Noordhoff), 1952, x + 550 pp.Google Scholar
[8]Kleene, S. C., Arithmetical predicates and function quantifiers, Transactions of the American Mathematical Society, vol. 79 (1955), pp. 312–340.CrossRefGoogle Scholar
[9]Kleene, S. C., Hierarchies of number-theoretic predicates, Bulletin of the American Mathematical Society, vol. 61 (1955), pp. 193–213.CrossRefGoogle Scholar
[10]Kleene, S. C. and Post, Emil L.. The upper semi-lattice of degrees of recursive unsolvability, Annals of mathematics, vol. 59 (1954), pp. 379–407.CrossRefGoogle Scholar
[11]Kuratowski, Casimir, Topologie I, 2nd ed., Warszawa-Wrocław, 1948, xi + 450 pp.Google Scholar
[12]Mučnik, A. A., Nérazréšimost′ problémy svodimosti téorii algoritmov (Negative answer to the problem of reducibility of the theory of algorithms), Doklady Akadémii Nauk SSSR, vol. 108 (1956), pp. 194–197, reviewed in this Journal, vol. 22, p. 218.Google Scholar
[13]Spector, Clifford, Recursive well-orderings, this Journal, vol. 20 (1955), pp. 151–163.Google Scholar
[14]Spector, Clifford, On degrees of recursive unsolvability, Annals of mathematics, vol. 64 (1956), pp. 581–592.CrossRefGoogle Scholar