The degrees of categorical theories with recursive models

DOI10.1090/S0002-9939-2013-11505-4zbMath1323.03044MaRDI QIDQ2839320

Uri Andrews

Publication date: 5 July 2013

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

Mathematics Subject Classification ID

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

Related Items (3)

Recursive spectra of flat strongly minimal theories ⋮ Building models of strongly minimal theories ⋮ Computing and dominating the Ryll-Nardzewski function

Cites Work

• Unnamed Item
• Unnamed Item
• A new strongly minimal set
• Computable structures and the hyperarithmetical hierarchy
• A new spectrum of recursive models using an amalgamation construction
• A computable ℵ₀-categorical structure whose theory computes true arithmetic
• MM. Borel, Tits, Zil′ber et le Général Nonsense
• Recursively presentable prime models
• Nonarithmetical ℵ₀-categorical theories with recursive models
• Trivial, strongly minimal theories are model complete after naming constants
• Model Theory
• Recursive spectra of strongly minimal theories satisfying the Zilber Trichotomy
• Complexity of Categorical Theories with Computable Models

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