Realizing Levels of the Hyperarithmetic Hierarchy as Degree Spectra of Relations on Computable Structures

Notre Dame Journal of Formal Logic 43 (1):51-64 (2002)
  Copy   BIBTEX

Abstract

We construct a class of relations on computable structures whose degree spectra form natural classes of degrees. Given any computable ordinal and reducibility r stronger than or equal to m-reducibility, we show how to construct a structure with an intrinsically invariant relation whose degree spectrum consists of all nontrivial r-degrees. We extend this construction to show that can be replaced by either or

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,667

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Analytics

Added to PP
2010-08-24

Downloads
48 (#462,030)

6 months
11 (#359,362)

Historical graph of downloads
How can I increase my downloads?

References found in this work

Pairs of recursive structures.C. J. Ash & J. F. Knight - 1990 - Annals of Pure and Applied Logic 46 (3):211-234.
Turing degrees of certain isomorphic images of computable relations.Valentina S. Harizanov - 1998 - Annals of Pure and Applied Logic 93 (1-3):103-113.
Ramified systems.C. J. Ash & J. F. Knight - 1994 - Annals of Pure and Applied Logic 70 (3):205-221.

View all 14 references / Add more references