Uncountable degree spectra

Annals of Pure and Applied Logic 54 (3):255-263 (1991)
  Copy   BIBTEX

Abstract

We consider a recursive model and an additional recursive relation R on its domain, such that there are uncountably many different images of R under isomorphisms from to some recursive model isomorphic to . We study properties of the set of Turing degrees of all these isomorphic images of R on the domain of

Categories

Keywords

Reprint years

DOI

10.1016/0168-0072(91)90049-r

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,991

External links

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

Through your library

My notes

Similar books and articles

The possible turing degree of the nonzero member in a two element degree spectrum.Valentina S. Harizanov - 1993 - Annals of Pure and Applied Logic 60 (1):1-30.
Turing degrees of certain isomorphic images of computable relations.Valentina S. Harizanov - 1998 - Annals of Pure and Applied Logic 93 (1-3):103-113.
Some effects of Ash–Nerode and other decidability conditions on degree spectra.Valentina S. Harizanov - 1991 - Annals of Pure and Applied Logic 55 (1):51-65.
Possible degrees in recursive copies II.C. J. Ash & J. F. Knight - 1997 - Annals of Pure and Applied Logic 87 (2):151-165.
Recursive properties of relations on models.Geoffrey R. Hird - 1993 - Annals of Pure and Applied Logic 63 (3):241-269.
Possible degrees in recursive copies.C. J. Ash & J. F. Knight - 1995 - Annals of Pure and Applied Logic 75 (3):215-221.
BERGER, U., Total sets and objects in domain theory DOWNEY, R., Every recursive boolean algebra is isomorphic to one with incomplete atoms GONCHAREV, S., YAKHNIS, A. and YAKHNIS, V., Some effectively infinite classes of enumerations. [REVIEW]P. Lincoln, A. Scedrov & N. Shankar - 1993 - Annals of Pure and Applied Logic 60:291.
Turing degrees of hypersimple relations on computable structures.Valentina S. Harizanov - 2003 - Annals of Pure and Applied Logic 121 (2-3):209-226.
Degrees of orderings not isomorphic to recursive linear orderings.Carl G. Jockusch & Robert I. Soare - 1991 - Annals of Pure and Applied Logic 52 (1-2):39-64.
Hyperarithmetical relations in expansions of recursive structures.Alan D. Vlach - 1994 - Annals of Pure and Applied Logic 66 (2):163-196.

Analytics

Added to PP
2014-01-16

Downloads
18 (#858,528)

6 months
4 (#862,849)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Valentina Harizanov
George Washington University

Citations of this work

Turing degrees of certain isomorphic images of computable relations.Valentina S. Harizanov - 1998 - Annals of Pure and Applied Logic 93 (1-3):103-113.
Permitting, forcing, and copying of a given recursive relation.C. J. Ash, P. Cholak & J. F. Knight - 1997 - Annals of Pure and Applied Logic 86 (3):219-236.

View all 8 citations / Add more citations

References found in this work

Degrees coded in jumps of orderings.Julia F. Knight - 1986 - Journal of Symbolic Logic 51 (4):1034-1042.
Stability of recursive structures in arithmetical degrees.C. J. Ash - 1986 - Annals of Pure and Applied Logic 32:113-135.
Intrinsically gs;0alpha; relations.E. Barker - 1988 - Annals of Pure and Applied Logic 39 (2):105-130.
Intrinsically< i> gs_;< sup> 0< sub> alpha; relations.E. Barker - 1988 - Annals of Pure and Applied Logic 39 (2):105-130.

Add more references