A computable ℵ0-categorical structure whose theory computes true arithmetic

DOI10.2178/JSL/1268917501MaRDI QIDQ3570169zbMATH OpenOpenAlexFDO

Authors Bakhadyr Khoussainov, Antonio Montalbán

Publication date 24 June 2010

Published in Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2178/jsl/1268917501

zbMATH Keywords

arithmetical complexitycomputable structurecountably categorical structure

Mathematics Subject Classification ID

Categoricity and completeness of theories (03C35) Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45) First-order arithmetic and fragments (03F30)

Cites work

• Computable models of theories with few models
• Computable structures and the hyperarithmetical hierarchy
• Decidable models
• Foundations of recursive model theory
• Nonarithmetical ℵ₀-categorical theories with recursive models
• On the computability-theoretic complexity of trivial, strongly minimal models
• Trivial, strongly minimal theories are model complete after naming constants
• Vaught's theorem recursively revisited

Cited in

(6)

• Constructing decidable graphs from decidable structures
• Computing and dominating the Ryll-Nardzewski function
• The degrees of categorical theories with recursive models
• Enumeration reducibility and computable structure theory
• Assigning an isomorphism type to a hyperdegree
• CODING IN GRAPHS AND LINEAR ORDERINGS

This page was built for publication: A computable ℵ₀-categorical structure whose theory computes true arithmetic

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