On the complexity of categoricity in computable structures
From MaRDI portal
Categoricity and completeness of theories (03C35) Computable structure theory, computable model theory (03C57) Complexity of computation (including implicit computational complexity) (03D15) Theory of numerations, effectively presented structures (03D45) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Cited in
(18)- Index sets for some classes of structures
- Finite computable dimension and degrees of categoricity
- Scott sentences for certain groups
- Categoricity spectra of computable structures
- Degrees of autostability relative to strong constructivizations for Boolean algebras
- Degrees of autostability for linear orders and linearly ordered abelian groups
- 2010 North American Annual Meeting of the Association for Symbolic Logic
- Computable categoricity of trees of finite height
- Decomposing the complexity quotient category
- Computability-Theoretic Complexity of Countable Structures
- The complexity of computable categoricity
- Relativizing computable categoricity
- Categoricity properties for computable algebraic fields
- Index sets for classes of high rank structures
- Fundamentals of Computation Theory
- Complexity of categorical theories with computable models
- Preserving categoricity and complexity of relations
- Computable numberings of the class of Boolean algebras with distinguished endomorphisms
This page was built for publication: On the complexity of categoricity in computable structures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4452455)
