Degrees of categoricity and the hyperarithmetic hierarchy
From MaRDI portal
Publication:1949167
DOI10.1215/00294527-1960479zbMath1311.03070OpenAlexW2013474162MaRDI QIDQ1949167
Johanna N. Y. Franklin, Richard A. Shore, Barbara F. Csima
Publication date: 25 April 2013
Published in: Notre Dame Journal of Formal Logic (Search for Journal in Brave)
Full work available at URL: https://projecteuclid.org/euclid.ndjfl/1361454975
isomorphismscomputability theorydegree of categoricityTuring degreescomputable structure theoryrelative categoricity
Theory of numerations, effectively presented structures (03D45) Other Turing degree structures (03D28)
Related Items
On categoricity spectra for locally finite graphs ⋮ Finite computable dimension and degrees of categoricity ⋮ Degrees of autostability relative to strong constructivizations of graphs ⋮ Degrees of autostability for prime Boolean algebras ⋮ Degrees of autostability relative to strong constructivizations for Boolean algebras ⋮ Degrees of categoricity vs. strong degrees of categoricity ⋮ Degrees of autostability for linear orders and linearly ordered abelian groups ⋮ Degrees that are not degrees of categoricity ⋮ Every Δ20 degree is a strong degree of categoricity ⋮ Scott ranks of models of a theory ⋮ Prime Model with No Degree of Autostability Relative to Strong Constructivizations ⋮ Effective categoricity for distributive lattices and Heyting algebras ⋮ Computable categoricity of the Boolean algebra \(\mathfrak{B}(\omega )\) with a distinguished automorphism ⋮ Effective algebraicity ⋮ Degrees of categoricity of trees and the isomorphism problem ⋮ On decidable categoricity and almost prime models ⋮ Degrees of categoricity for superatomic Boolean algebras ⋮ Revisiting Uniform Computable Categoricity: For the Sixtieth Birthday of Prof. Rod Downey ⋮ Strength and Weakness in Computable Structure Theory ⋮ Strong degrees of categoricity and weak density ⋮ A Note on Effective Categoricity for Linear Orderings ⋮ Computable bi-embeddable categoricity ⋮ Degrees of and lowness for isometric isomorphism ⋮ DEGREES OF CATEGORICITY AND SPECTRAL DIMENSION ⋮ Computability-theoretic categoricity and Scott families ⋮ Categoricity spectra for polymodal algebras ⋮ DEGREES OF CATEGORICITY ON A CONE VIAη-SYSTEMS ⋮ 2-Computably Enumerable Degrees of Categoricity for Boolean Algebras with Distinguished Automorphisms ⋮ Degrees of categoricity of rigid structures ⋮ Punctual categoricity relative to a computable oracle ⋮ Categoricity spectra of computable structures ⋮ The theory of projective planes is complete with respect to degree spectra and effective dimensions ⋮ Decompositions of decidable abelian groups ⋮ Turing degrees of complete formulas of almost prime models ⋮ The degree of decidable categoricity of a model with infinite solutions for complete formulas ⋮ Analytic computable structure theory and \(L^p\)-spaces. II ⋮ Degrees of bi-embeddable categoricity of equivalence structures ⋮ On bi-embeddable categoricity of algebraic structures ⋮ Coding in the automorphism group of a computably categorical structure ⋮ Degrees of bi-embeddable categoricity ⋮ Computability-theoretic properties of injection structures ⋮ On \(\Delta_2^0\)-categoricity of equivalence relations ⋮ Autostability spectra for Boolean algebras
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Realizing levels of the hyperarithmetic hierarchy as degree spectra of relations on computable structures
- Computable structures and the hyperarithmetical hierarchy
- Degrees of categoricity of computable structures
- Non Σn axiomatizable almost strongly minimal theories
