Degrees of categoricity and the hyperarithmetic hierarchy
From MaRDI portal
Publication:1949167
DOI10.1215/00294527-1960479zbMath1311.03070MaRDI 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
isomorphisms; computability theory; degree of categoricity; Turing degrees; computable structure theory; relative categoricity
03D45: Theory of numerations, effectively presented structures
03D28: Other Turing degree structures
Related Items
DEGREES OF CATEGORICITY AND SPECTRAL DIMENSION, Coding in the automorphism group of a computably categorical structure, Degrees of bi-embeddable categoricity, Every Δ20 degree is a strong degree of categoricity, Degrees of categoricity of trees and the isomorphism problem, Degrees of and lowness for isometric isomorphism, Decompositions of decidable abelian groups, DEGREES OF CATEGORICITY ON A CONE VIAη-SYSTEMS, 2-Computably Enumerable Degrees of Categoricity for Boolean Algebras with Distinguished Automorphisms, The theory of projective planes is complete with respect to degree spectra and effective dimensions, Degrees that are not degrees of categoricity, Computable categoricity of the Boolean algebra \(\mathfrak{B}(\omega )\) with a distinguished automorphism, Categoricity spectra for polymodal algebras, 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, Scott ranks of models of a theory, Computable bi-embeddable categoricity, Computability-theoretic categoricity and Scott families, Effective algebraicity, Degrees of categoricity of rigid structures, Punctual categoricity relative to a computable oracle, Categoricity spectra of computable structures, The degree of decidable categoricity of a model with infinite solutions for complete formulas, On bi-embeddable categoricity of algebraic structures, On decidable categoricity and almost prime models, Strong degrees of categoricity and weak density, Turing degrees of complete formulas of almost prime models, Analytic computable structure theory and \(L^p\)-spaces. II, Degrees of bi-embeddable categoricity of equivalence structures, Computability-theoretic properties of injection structures, On \(\Delta_2^0\)-categoricity of equivalence relations, Autostability spectra for 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, Effective categoricity for distributive lattices and Heyting algebras, 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, A Note on Effective Categoricity for Linear Orderings, Prime Model with No Degree of Autostability Relative to Strong Constructivizations
Cites Work
- 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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
