The degrees of categorical theories with recursive models
From MaRDI portal
Publication:2839320
DOI10.1090/S0002-9939-2013-11505-4zbMath1323.03044MaRDI QIDQ2839320
Publication date: 5 July 2013
Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)
03C57: Computable structure theory, computable model theory
03C35: Categoricity and completeness of theories
Related Items
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 ℵ0-categorical structure whose theory computes true arithmetic
- MM. Borel, Tits, Zil′ber et le Général Nonsense
- Recursively presentable prime models
- Nonarithmetical ℵ0-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