Complexity of Categorical Theories with Computable Models

DOI10.1023/B:ALLO.0000048826.92325.02MaRDI QIDQ5476776zbMATH OpenOpenAlexFDO

Authors Bakhadyr Khoussainov, S. S. Goncharov

Publication date 18 July 2006

Published in Algebra and Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/b:allo.0000048826.92325.02

zbMATH Keywords

countably categorical theoryuncountably categorical theoryweakly minimal theoryTuring degree of a theory

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1936725
• Complexity of categorical theories with computable models
• Complexity of categorical theories with computable models
• The degrees of categorical theories with recursive models
• Computable models of theories with few models

Cited in

(27)

• On two problems of Turing complexity for strongly minimal theories
• Semidecidable numberings in admissible sets
• scientific article; zbMATH DE number 1936725 (Why is no real title available?)
• Classification from a Computable Viewpoint
• 2010 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '10
• Relativizing computable categoricity
• On the computability-theoretic complexity of trivial, strongly minimal models
• Complexity of categorical theories with computable models
• Complexity of categorical theories with computable models
• Conservative extensions of abstract structures
• Categoricity and generalized model completeness
• Index sets of constructive models of bounded signature that are autostable relative to strong constructivizations
• Rice sequences of relations
• 2008 Annual Meeting of the Association for Symbolic Logic
• Enumeration reducibility and computable structure theory
• The degrees of categorical theories with recursive models
• scientific article; zbMATH DE number 1556962 (Why is no real title available?)
• Index sets for some classes of structures
• Index sets for \(n\)-decidable structures categorical relative to \(m\)-decidable presentations
• Index sets of constructive models that are autostable under strong constructivizations
• scientific article; zbMATH DE number 1834650 (Why is no real title available?)
• The index set of Boolean algebras autostable relative to strong constructivizations
• Classes of Ulm type and coding rank-homogeneous trees in other structures
• Computable embeddings and strongly minimal theories
• Degrees of categoricity of computable structures
• Applications of Kolmogorov complexity to computable model theory
• Complexity of Ehrenfeucht models

This page was built for publication: Complexity of Categorical Theories with Computable Models

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