Relativizing computable categoricity

DOI10.1090/proc/15471zbMath1496.03153OpenAlexW3175198388MaRDI QIDQ5002563

Matthew Harrison-Trainor, Alexander G. Melnikov, Rodney G. Downey

Publication date: 28 July 2021

Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1090/proc/15471

Mathematics Subject Classification ID

Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45)

Related Items (1)

Degrees of relative computable categoricity

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The complexity of computable categoricity
• Independence in computable algebra
• Generic copies of countable structures
• Autostability of models and Abelian groups
• Effective choice for relations and reducibilities in classes of constructive and positive models
• Finite computable dimension does not relativize
• Computable structures and the hyperarithmetical hierarchy
• Computable torsion abelian groups
• Recursively Categorical Linear Orderings
• Degree Spectra of Relations on Computable Structures
• Computable categoricity versus relative computable categoricity
• Coding in the automorphism group of a computably categorical structure
• CONSTRUCTIVE ALGEBRAS I
• Effective model theory vs. recursive model theory

This page was built for publication: Relativizing computable categoricity