scientific article; zbMATH DE number 1936725

MaRDI QIDQ4406589zbMATH OpenFDO

Authors B. Khusainov, S. S. Goncharov

Publication date 25 June 2003

zbMATH Keywords

computable modelhomogeneous modelrecursive modeluncountably categorical theory

Mathematics Subject Classification ID

Model theory of denumerable and separable structures (03C15) Categoricity and completeness of theories (03C35) Models with special properties (saturated, rigid, etc.) (03C50) Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45)

Recommendations

• Complexity of Categorical Theories with Computable Models
• Complexity of categorical theories with computable models
• Computable models of theories with few models
• Complexity of categorical theories with computable models
• scientific article; zbMATH DE number 5175704

Cited in

(13)

• Computable models of theories with few models
• Building models of strongly minimal theories
• The degrees of categorical theories with recursive models
• Complexity of categorical theories with computable models
• Algorithmic complexity of countable models of strongly minimal theories
• Complexity of Ehrenfeucht models
• Nonarithmetical ℵ₀-categorical theories with recursive models
• scientific article; zbMATH DE number 1556962 (Why is no real title available?)
• scientific article; zbMATH DE number 5175704 (Why is no real title available?)
• Complexity of Categorical Theories with Computable Models
• On ℵ₁ many minimal models
• Complexity of categorical theories with computable models
• On two problems of Turing complexity for strongly minimal theories

This page was built for publication:

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