Non Σn axiomatizable almost strongly minimal theories

DOI10.2307/2274752MaRDI QIDQ3475255zbMATH OpenOpenAlexFDO

Authors David Marker

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

zbMATH Keywords

almost strongly minimal theoryaxiomatizabilitycategoricity

Mathematics Subject Classification ID

Categoricity and completeness of theories (03C35) Models of other mathematical theories (03C65)

Recommendations

• The non-axiomatizability of o-minimality
• Non-pointed strongly protomodular theories
• Remarks on strong nonstructure theorems
• Non-finite-axiomatizability results in algebraic logic
• Model-theoretic Elekes–Szabó in the strongly minimal case
• The problem of finite axiomatizability for strongly minimal graph theories
• On the enrichment of almost o-minimal theories
• scientific article; zbMATH DE number 4089542
• scientific article; zbMATH DE number 4064248
• scientific article; zbMATH DE number 4063073

Cites work

• Omitting types of prenex formulas
• Quasi finitely axiomatizable totally categorical theories

Cited in

(30)

• 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
• Quasi finitely axiomatizable totally categorical theories
• Alpha-theory: An elementary axiomatics for nonstandard analysis
• Constructing -stable structures: Model completeness.
• The Schröder-Bernstein property for weakly minimal theories
• Degrees of categoricity and the hyperarithmetic hierarchy
• Simple structures with complex symmetry
• Semidecidable numberings in admissible sets
• Degrees of categoricity of computable structures
• The non-axiomatizability of o-minimality
• Enumeration reducibility and computable structure theory
• Strength and weakness in computable structure theory
• Conservative extensions of abstract structures
• A complete theory with arbitrarily large minimality ranks
• scientific article; zbMATH DE number 4063073 (Why is no real title available?)
• scientific article; zbMATH DE number 4075030 (Why is no real title available?)
• There is no classification of the decidably presentable structures
• A computable functor from graphs to fields
• The index set of Boolean algebras autostable relative to strong constructivizations
• IS A SPECTRUM OF A NON-DISINTEGRATED FLAT STRONGLY MINIMAL MODEL COMPLETE THEORY IN A LANGUAGE WITH FINITE SIGNATURE
• Theory spectra and classes of theories
• On the computability-theoretic complexity of trivial, strongly minimal models
• DMP in strongly minimal sets
• Spectra of theories and structures
• Index sets of constructive models that are autostable under strong constructivizations
• A pathological punctually 1-decidable structure
• Model completeness for trivial, uncountably categorical theories of Morley rank 1
• 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

This page was built for publication: Non Σ_n axiomatizable almost strongly minimal theories

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3475255)