Degree Spectra of Relations on a Cone
Abstract
Let be a mathematical structure with an additional relation . We are interested in the degree spectrum of , either among computable copies of when is a "natural" structure, or (to make this rigorous) among copies of computable in a large degree \textbf{d}. We introduce the partial order of degree spectra \textit{on a cone} and begin the study of these objects. Using a result of Harizanov---that, assuming an effectiveness condition on and , if is not intrinsically computable, then its degree spectrum contains all c.e.\ degrees---we see that there is a minimal non-trivial degree spectrum on a cone, consisting of the c.e.\ degrees. We show that this does not generalize to d.c.e.\ degrees by giving an example of two incomparable degree spectra on a cone. We also give a partial answer to a question of Ash and Knight: they asked whether (subject to some effectiveness conditions) a relation which is not intrinsically must have a degree spectrum which contains all of the -CEA degrees. We give a positive answer to this question for by showing that any degree spectrum on a cone which strictly contains the degrees must contain all of the 2-CEA degrees. We also investigate the particular case of degree spectra on the structure . This work represents the beginning of an investigation of the degree spectra of "natural" structures, and we leave many open questions to be answered.
Keywords
Cite
@article{arxiv.1412.3842,
title = {Degree Spectra of Relations on a Cone},
author = {Matthew Harrison-Trainor},
journal= {arXiv preprint arXiv:1412.3842},
year = {2014}
}