Degrees of selector functions and relative computable categoricity
Logic
2023-05-31 v1
Abstract
We study the degrees of selector functions related to the degrees in which a rigid computable structure is relatively computably categorical. It is proved that for some structures such degrees can be represented as the unions of upper cones of c.e. degrees. In addition we show that there are non-c.e. upper cones realized as the degrees in which some computable structure is relatively computably categorical.
Keywords
Cite
@article{arxiv.2305.18581,
title = {Degrees of selector functions and relative computable categoricity},
author = {I. Sh. Kalimullin},
journal= {arXiv preprint arXiv:2305.18581},
year = {2023}
}