A new spectrum of recursive models
From MaRDI portal
Publication:701304
DOI10.1305/ndjfl/1022615611zbMath1007.03036MaRDI QIDQ701304
Publication date: 27 March 2003
Published in: Notre Dame Journal of Formal Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1305/ndjfl/1022615611
countable models; strongly minimal theory; computable presentation; \(\omega_1\)-categorical theory; complexity of spectra
03C57: Computable structure theory, computable model theory
03C35: Categoricity and completeness of theories
Related Items
IS A SPECTRUM OF A NON-DISINTEGRATED FLAT STRONGLY MINIMAL MODEL COMPLETE THEORY IN A LANGUAGE WITH FINITE SIGNATURE, Recursive spectra of flat strongly minimal theories, On the computability-theoretic complexity of trivial, strongly minimal models, 2006 Summer Meeting of the Association for Symbolic Logic: Logic Colloquium '06, Spectra of recursive models of disintegrated strongly minimal theories, An uncountably categorical theory whose only computably presentable model is saturated, A new spectrum of recursive models using an amalgamation construction, Classifying model-theoretic properties
Cites Work