The degrees of categorical theories with recursive models

DOI10.1090/S0002-9939-2013-11505-4MaRDI QIDQ2839320zbMATH OpenFDO

Authors Uri Andrews

Publication date 5 July 2013

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

Mathematics Subject Classification ID

Categoricity and completeness of theories (03C35) Computable structure theory, computable model theory (03C57)

Recommendations

• Complexity of Categorical Theories with Computable Models
• scientific article; zbMATH DE number 1936725
• Complexity of categorical theories with computable models
• Nonarithmetical ℵ₀-categorical theories with recursive models
• Categoricity in hyperarithmetical degrees

Cites work

• scientific article; zbMATH DE number 5148402 (Why is no real title available?)
• scientific article; zbMATH DE number 1007358 (Why is no real title available?)
• A computable ℵ₀-categorical structure whose theory computes true arithmetic
• A new spectrum of recursive models using an amalgamation construction
• A new strongly minimal set
• Complexity of Categorical Theories with Computable Models
• Computable structures and the hyperarithmetical hierarchy
• MM. Borel, Tits, Zil′ber et le Général Nonsense
• Model Theory
• Nonarithmetical ℵ₀-categorical theories with recursive models
• Recursive spectra of strongly minimal theories satisfying the Zilber trichotomy
• Recursively presentable prime models
• Trivial, strongly minimal theories are model complete after naming constants

Cited in

(14)

• The elementary theory of the recursively enumerable degrees is not \(\aleph _ 0\)-categorical
• Computing and dominating the Ryll-Nardzewski function
• The complexity of countable categoricity in finite languages
• Categoricity and generalized model completeness
• Recursive categoricity and persistence
• scientific article; zbMATH DE number 4105024 (Why is no real title available?)
• Model-theoretic properties of the \(n\)-c.e. degrees
• Building models of strongly minimal theories
• The degree of decidable categoricity of a model with infinite solutions for complete formulas
• Recursive spectra of flat strongly minimal theories
• Sufficiency conditions for theories with recursive models
• Complexity of Categorical Theories with Computable Models
• Categoricity in hyperarithmetical degrees
• Computably categorical structures and expansions by constants

This page was built for publication: The degrees of categorical theories with recursive models

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