Notes on degrees of relative computable categoricity
Logic
2023-04-07 v3
Abstract
We are studying the degrees in which a computable structure is relatively computably categoricity, i.e., computably categorcial among all non-computable copies of the structure. Unlike the degrees of computable categoricity we can bound the possible degrees of relative computable categoricity by the oracle 0". In the case of rigid structures the bound is in fact 0'. These estimations are precise, in particular we can build a computable structure which is relatively computably categorical only in the degrees above 0".
Cite
@article{arxiv.2207.08316,
title = {Notes on degrees of relative computable categoricity},
author = {I. Sh. Kalimullin},
journal= {arXiv preprint arXiv:2207.08316},
year = {2023}
}