Non Σn axiomatizable almost strongly minimal theories
From MaRDI portal
Publication:3475255
DOI10.2307/2274752zbMath0698.03021OpenAlexW2001479515MaRDI QIDQ3475255
Publication date: 1989
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2274752
Related Items
On the computability-theoretic complexity of trivial, strongly minimal models, Model completeness for trivial, uncountably categorical theories of Morley rank \(1\), There is no classification of the decidably presentable structures, Degrees of categoricity of computable structures, Index sets of constructive models of bounded signature that are autostable relative to strong constructivizations, Index sets for \(n\)-decidable structures categorical relative to \(m\)-decidable presentations, Degrees of categoricity and the hyperarithmetic hierarchy, Enumeration Reducibility and Computable Structure Theory, Strength and Weakness in Computable Structure Theory, Simple structures with complex symmetry, Semidecidable numberings in admissible sets, Constructing \(\omega\)-stable structures: Model completeness., A COMPUTABLE FUNCTOR FROM GRAPHS TO FIELDS, The index set of Boolean algebras autostable relative to strong constructivizations, Index Sets of Constructive Models that are Autostable Under Strong Constructivizations, Special issue: Selected papers of the workshop on model theory and computable model theory, Gainesville, FL, USA, February 5--10, 2007, Index sets for some classes of structures, Conservative Extensions of Abstract Structures, Spectra of theories and structures, Theory spectra and classes of theories
Cites Work
