Constructive models of uncountably categorical theories
From MaRDI portal
Publication:4268931
DOI10.1090/S0002-9939-99-04920-5zbMath0932.03036MaRDI QIDQ4268931
Steffen Lempp, Martin Ziegler, Bernhard Herwig
Publication date: 28 October 1999
Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)
Cayley graph; computable model; constructive model; unsolvable word problem; strongly minimal set; recursive model; uncountably categorical first-order theory
03C57: Computable structure theory, computable model theory
03D45: Theory of numerations, effectively presented structures
03C35: Categoricity and completeness of theories
Related Items
On the computability-theoretic complexity of trivial, strongly minimal models, Recursive spectra of strongly minimal theories satisfying the Zilber Trichotomy, New spectra of strongly minimal theories in finite languages, Spectra of recursive models of disintegrated strongly minimal theories, A new spectrum of recursive models using an amalgamation construction