DEGREES OF CATEGORICITY ON A CONE VIA η-SYSTEMS

@article{Csima2017DEGREESOC,
  title={DEGREES OF CATEGORICITY ON A CONE VIA $\eta$-SYSTEMS},
  author={Barbara F. Csima and Matthew Harrison-Trainor},
  journal={The Journal of Symbolic Logic},
  year={2017},
  volume={82},
  pages={325 - 346}
}
Abstract We investigate the complexity of isomorphisms of computable structures on cones in the Turing degrees. We show that, on a cone, every structure has a strong degree of categoricity, and that degree of categoricity is ${\rm{\Delta }}_\alpha ^0 $ -complete for some α. To prove this, we extend Montalbán’s η-system framework to deal with limit ordinals in a more general way. We also show that, for any fixed computable structure, there is an ordinal α and a cone in the Turing degrees such… 
On Decidable Categoricity and Almost Prime Models
TLDR
The degree of categoricity of various prime models with added constants, also called almost prime models, is investigated, and the Turing degree of the set C(\mathcal {M}) of complete formulas is related to the Turing level of that set.
Degrees of categoricity of trees and the isomorphism problem
  • M. Mahmoud
  • Mathematics, Computer Science
    Math. Log. Q.
  • 2019
TLDR
It follows from the proofs that, for every computable ordinal α>0, the isomorphism problem for trees of rank α is Π2α0 ‐complete.
Martin's Conjecture: A Classification of the Naturally Occurring Turing Degrees
  • A. Montalbán
  • Mathematics
    Notices of the American Mathematical Society
  • 2019
This paper is about naturally occurring objects in computability theory, the area inside mathematical logic that studies the complexity of infinite countable objects. It is about the structure that
Categoricity Spectra of Computable Structures
TLDR
This paper focuses on the results about degrees of categoricity for linear orders and Boolean algebras, and constructs a new series of examples of Degrees of categricity forlinear orders.
Computable Procedures for Fields
This tutorial will introduce listeners to many questions that can be asked about computable processes on fields, and will present the answers that are known, sometimes with proofs. This is not
Coding in the automorphism group of a computably categorical structure
TLDR
This work constructs a structure with degree of categoricity but infinite spectral dimension, answering a question of Bazhenov, Kalimulin and Yamaleev, and constructs a computably categorical structure of non-computable Scott rank, and a structure of computable dimension 2 such that there is no hyperarithmetic isomorphism between the two copies.

References

SHOWING 1-10 OF 38 REFERENCES
Degree Spectra of Relations on a Cone
TLDR
This work represents the beginning of an investigation of the degree spectra of "natural" structures, and it is shown that any degree spectrum on a cone which strictly contains the $\Delta^0_2$ degrees must contain all of the 2-CEA degrees.
Degrees of categoricity of computable structures
TLDR
It is shown that for all n, degrees d.c.e. in and above 0(n) can be so realized, as can the degree 0(ω), which Turing degrees can be realized as degrees of categoricity.
Degrees That Are Not Degrees of Categoricity
TLDR
A large class of degrees that are not degrees of categoricity are demonstrated by showing that every degree of a set which is 2-generic relative to some perfect tree is not a degree of categricity.
Degrees coded in jumps of orderings
  • J. Knight
  • Mathematics
    Journal of Symbolic Logic
  • 1986
TLDR
It would be satisfying to have a way of assigning Turing degrees to structures such that the degree assigned to a given structure measured the recursion-theoretic complexity of the isomorphism type and was independent of the presentation.
Degrees of Categoricity and the Hyperarithmetic Hierarchy
TLDR
It is shown that for every computable ordinal α, 0 is the degree of categoricity of some computable structure A, and that for α a computable successor ordinal, every degree 2-c, i.e. in and above 0 is a degree ofategoricity.
RECURSIVE LABELLING SYSTEMS AND STABILITY OF RECURSIVE STRUCTURES IN HYPERARITHMETICAL DEGREES
We show that, under certain assumptions of recursiveness in 21, the recursive structure 21 is A^-stable for a < wfK if and only if there is an enumeration of 21 using a E^ set of recursive EQ
Categoricity Spectra for Rigid Structures
TLDR
This paper investigates spectra of categoricity for computable rigid structures with least degree and gives examples of rigid structures without degrees of categricity.
The axiom of determinateness and reduction principles in the analytical hierarchy
Let R be the set of all sets of natural numbers. A collection (ü of subsets of R satisfies a reduction principle if, for every A and 5 G d , there are A' and B'E® such that A'QA^B'QB, A'UB'=*AUB, and
...
...