Hostname: page-component-7b7567c8c-wxvwp Total loading time: 0 Render date: 2026-11-17T05:16:39.817Z Has data issue: false hasContentIssue false

Measure-theoretic construction of incomparable hyperdegrees

Published online by Cambridge University Press:  12 March 2014

Clifford Spector*
Affiliation:
The Ohio State University

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].

Information

Type
Research Article
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.)

Article purchase

Temporarily unavailable