论文信息 - Uncountable Degree Spectra

Uncountable Degree Spectra

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

Valentina S. Harizanov

[1] R. Soare,et al. Π⁰₁ classes and degrees of theories , 1972 .

[2] Christopher J. Ash. Stability of recursive structures in arithmetical degrees , 1986, Ann. Pure Appl. Log..

[3] Julia F. Knight,et al. Degrees coded in jumps of orderings , 1986, Journal of Symbolic Logic.

[4] S. S. Goncharov,et al. Autostability and computable families of constructivizations , 1975 .

[5] E. Barker. Intrinsically gs;0alpha; relations , 1988, Ann. Pure Appl. Log..

[6] C. Ash,et al. Recursive labelling systems and stability of recursive structures in hyperarithmetical degrees , 1986 .