IS A SPECTRUM OF A NON-DISINTEGRATED FLAT STRONGLY MINIMAL MODEL COMPLETE THEORY IN A LANGUAGE WITH FINITE SIGNATURE

DOI10.1017/JSL.2021.11OpenAlexW3129136126MaRDI QIDQ5021931

Uri Andrews, Omer Mermelstein

Publication date: 17 January 2022

Published in: The Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1908.09387

zbMATH Keywords

flatnessHrushovski constructionspectrum of computable modelsspectrum of recursive models

Mathematics Subject Classification ID

Computable structure theory, computable model theory (03C57) Other model constructions (03C30)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• New spectra of strongly minimal theories in finite languages
• A new strongly minimal set
• A new spectrum of recursive models
• Computable models of theories with few models
• Strongly minimal theories with recursive models
• Building models of strongly minimal theories
• An uncountably categorical theory whose only computably presentable model is saturated
• A new spectrum of recursive models using an amalgamation construction
• Constructive models of uncountably categorical theories
• Trivial, strongly minimal theories are model complete after naming constants
• On the computability-theoretic complexity of trivial, strongly minimal models
• Recursive spectra of strongly minimal theories satisfying the Zilber Trichotomy
• Applications of Kolmogorov complexity to computable model theory
• On strongly minimal sets

This page was built for publication: IS A SPECTRUM OF A NON-DISINTEGRATED FLAT STRONGLY MINIMAL MODEL COMPLETE THEORY IN A LANGUAGE WITH FINITE SIGNATURE