Possible degrees in recursive copies

Annals of Pure and Applied Logic 75 (3):215-221 (1995)
  Copy   BIBTEX

Abstract

Let be a recursive structure, and let R be a recursive relation on . Harizanov isolated a syntactical condition which is necessary and sufficient for to have recursive copies in which the image of R is r.e. of arbitrary r.e. degree. We had conjectured that a certain extension of Harizanov's syntactical condition would be necessary and sufficient for to have recursive copies in which the image of R is ∑α0 of arbitrary ∑α0 degree, but this is not the case. Here we give examples illustrating some restrictions on the possible ∑α0 degrees. In these examples, the image of R cannot be ∑α0 of degree d unless d possesses an “α-table”

Other Versions

No versions found

Links

PhilArchive



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

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

Possible degrees in recursive copies II.C. J. Ash & J. F. Knight - 1997 - Annals of Pure and Applied Logic 87 (2):151-165.
On the r.e. predecessors of d.r.e. degrees.Shamil Ishmukhametov - 1999 - Archive for Mathematical Logic 38 (6):373-386.
Hyperarithmetical relations in expansions of recursive structures.Alan D. Vlach - 1994 - Annals of Pure and Applied Logic 66 (2):163-196.
Uncountable degree spectra.Valentina S. Harizanov - 1991 - Annals of Pure and Applied Logic 54 (3):255-263.
Countable thin Π01 classes.Douglas Cenzer, Rodney Downey, Carl Jockusch & Richard A. Shore - 1993 - Annals of Pure and Applied Logic 59 (2):79-139.
Turing degrees of certain isomorphic images of computable relations.Valentina S. Harizanov - 1998 - Annals of Pure and Applied Logic 93 (1-3):103-113.
Recursive properties of relations on models.Geoffrey R. Hird - 1993 - Annals of Pure and Applied Logic 63 (3):241-269.

Analytics

Added to PP
2014-01-16

Downloads
29 (#774,799)

6 months
7 (#706,906)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Possible degrees in recursive copies II.C. J. Ash & J. F. Knight - 1997 - Annals of Pure and Applied Logic 87 (2):151-165.
Coding a family of sets.J. F. Knight - 1998 - Annals of Pure and Applied Logic 94 (1-3):127-142.
Generalized weak presentations.Alexandra Shlapentokh - 2002 - Journal of Symbolic Logic 67 (2):787-819.

Add more citations

References found in this work

Degrees of Unsolvability.Gerald E. Sacks - 1966 - Princeton University Press.
Ramified systems.C. J. Ash & J. F. Knight - 1994 - Annals of Pure and Applied Logic 70 (3):205-221.

Add more references