Complexity of Categorical Theories with Computable Models
From MaRDI portal
Publication:5476776
DOI10.1023/B:ALLO.0000048826.92325.02zbMath1097.03027OpenAlexW2012121601MaRDI QIDQ5476776
Bakhadyr Khoussainov, Sergei 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
countably categorical theoryuncountably categorical theoryweakly minimal theoryTuring degree of a theory
Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45) Categoricity and completeness of theories (03C35)
Related Items (18)
Classes of Ulm type and coding rank-homogeneous trees in other structures ⋮ On the computability-theoretic complexity of trivial, strongly minimal models ⋮ Degrees of categoricity of computable structures ⋮ Rice sequences of relations ⋮ 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 ⋮ Enumeration Reducibility and Computable Structure Theory ⋮ Semidecidable numberings in admissible sets ⋮ Complexity of Ehrenfeucht models ⋮ The index set of Boolean algebras autostable relative to strong constructivizations ⋮ 2010 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '10 ⋮ Computable embeddings and strongly minimal theories ⋮ Index Sets of Constructive Models that are Autostable Under Strong Constructivizations ⋮ 2008 Annual Meeting of the Association for Symbolic Logic ⋮ Index sets for some classes of structures ⋮ Conservative Extensions of Abstract Structures ⋮ The degrees of categorical theories with recursive models ⋮ Classification from a Computable Viewpoint
This page was built for publication: Complexity of Categorical Theories with Computable Models
