Constructive models of uncountably categorical theories

DOI10.1090/S0002-9939-99-04920-5zbMath0932.03036OpenAlexW1575274885MaRDI QIDQ4268931

Martin Ziegler, Steffen Lempp, Bernhard Herwig

Publication date: 28 October 1999

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

Full work available at URL: https://doi.org/10.1090/s0002-9939-99-04920-5

zbMATH Keywords

Cayley graphcomputable modelconstructive modelunsolvable word problemstrongly minimal setrecursive modeluncountably categorical first-order theory

Mathematics Subject Classification ID

Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45) Categoricity and completeness of theories (03C35)

Related Items (7)

A new spectrum of recursive models using an amalgamation construction ⋮ On the computability-theoretic complexity of trivial, strongly minimal models ⋮ Effectively Existentially-Atomic Structures ⋮ New spectra of strongly minimal theories in finite languages ⋮ Recursive spectra of strongly minimal theories satisfying the Zilber Trichotomy ⋮ Spectra of recursive models of disintegrated strongly minimal theories ⋮ IS A SPECTRUM OF A NON-DISINTEGRATED FLAT STRONGLY MINIMAL MODEL COMPLETE THEORY IN A LANGUAGE WITH FINITE SIGNATURE

This page was built for publication: Constructive models of uncountably categorical theories