Abstract
Abstract
We introduce several highness notions on degrees related to the problem of computing isomorphisms between structures, provided that isomorphisms exist. We consider variants along axes of uniformity, inclusion of negative information, and several other problems related to computing isomorphisms. These other problems include Scott analysis (in the form of back-and-forth relations), jump hierarchies, and computing descending sequences in linear orders.
Publisher
Cambridge University Press (CUP)
Reference26 articles.
1. [18] Le Goh, J. , Inseparable ${\varPi}_1^1$ sets, in preparation.
2. [19] Goncharov, S. S. , Harizanov, V. S. , Knight, J. F. , and Shore, R. A. , ${\varPi}_1^1$ relations and paths through $\mathbf{\mathcal{O}}$ , this Journal, vol. 69 (2004), no. 2, pp. 585–611.
3. Relativizations of randomness and genericity notions
4. Computable structure and antistructure theorems;Goncharov;Algebra and Logic,2002
5. [22] Kurtz, S. A. , Notions of weak genericity, this Journal, vol. 48 (1983), no. 3, pp. 764–770.