Coding in the automorphism group of a computably categorical structure

DOI10.1142/S0219061320500166MaRDI QIDQ4988826zbMATH OpenOpenAlexFDO

Authors 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

computable structuredegree of categoricitydegree of isomorphismScott rankspectral dimension

Mathematics Subject Classification ID

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

Abstract: Using new techniques for controlling the categoricity spectrum of a structure, we construct a structure with degree of categoricity but infinite spectral dimension, answering a question of Bazhenov, Kalimulin and Yamaleev. Using the same techniques, we construct 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.

Recommendations

• Degrees of categoricity and spectral dimension
• Computability-theoretic categoricity and Scott families
• Categoricity spectra for rigid structures
• Categoricity spectra of computable structures
• Degrees of categoricity of computable structures

Cites work

• A computably categorical structure whose expansion by a constant has infinite computable dimension
• Categoricity in hyperarithmetical degrees
• Computable structures and the hyperarithmetical hierarchy
• Computably categorical structures and expansions by constants
• Degrees of categoricity and spectral dimension
• Degrees of categoricity and the hyperarithmetic hierarchy
• Degrees of categoricity of computable structures
• Degrees of categoricity on a cone via -systems
• Degrees that Are Low for Isomorphism
• Degrees that are not degrees of categoricity
• Finite computable dimension and degrees of categoricity
• Higher randomness and genericity
• scientific article; zbMATH DE number 3628930 (Why is no real title available?)
• Lowness for isomorphism and degrees of genericity
• Strength and weakness in computable structure theory
• The complexity of computable categoricity
• The isometry degree of a computable copy of ^p

Cited in

(13)

• Computability-theoretic categoricity and Scott families
• Simple structures with complex symmetry
• Punctual categoricity relative to a computable oracle
• Strong degrees of categoricity and weak density
• Degrees of categoricity and spectral dimension
• A computably categorical structure whose expansion by a constant has infinite computable dimension
• Relativizing computable categoricity
• An introduction to the Scott complexity of countable structures and a survey of recent results
• Degrees of categoricity and treeable degrees
• Scott analysis, linear orders, and almost periodic functions
• Punctually presented structures. II: Comparing presentations.
• Structures of finite punctual dimension \(n>2\)
• Automorphism groups associated to a family of Hopf algebras

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4988826)