Coding in the automorphism group of a computably categorical structure

DOI10.1142/S0219061320500166zbMath1477.03147arXiv1905.07850OpenAlexW3008835028MaRDI QIDQ4988826

Dan Turetsky

Publication date: 19 May 2021

Published in: Journal of Mathematical Logic (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1905.07850

zbMATH Keywords

spectral dimensioncomputable structuredegree of categoricityScott rankdegree of isomorphism

Mathematics Subject Classification ID

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

Related Items (4)

AN INTRODUCTION TO THE SCOTT COMPLEXITY OF COUNTABLE STRUCTURES AND A SURVEY OF RECENT RESULTS ⋮ Strong degrees of categoricity and weak density ⋮ Punctual categoricity relative to a computable oracle ⋮ Relativizing computable categoricity

Cites Work

• Unnamed Item
• Degrees that are not degrees of categoricity
• The complexity of computable categoricity
• Computable structures and the hyperarithmetical hierarchy
• Finite computable dimension and degrees of categoricity
• The isometry degree of a computable copy of \(\ell^p\)
• Categoricity in hyperarithmetical degrees
• Degrees of categoricity and the hyperarithmetic hierarchy
• Degrees of categoricity of computable structures
• Strength and Weakness in Computable Structure Theory
• Computably categorical structures and expansions by constants
• HIGHER RANDOMNESS AND GENERICITY
• Lowness for isomorphism and degrees of genericity
• DEGREES OF CATEGORICITY AND SPECTRAL DIMENSION
• A computably categorical structure whose expansion by a constant has infinite computable dimension
• Degrees that Are Low for Isomorphism
• DEGREES OF CATEGORICITY ON A CONE VIAη-SYSTEMS

This page was built for publication: Coding in the automorphism group of a computably categorical structure