On the complexity of categoricity in computable structures
DOI10.1002/MALQ.200310066zbMATH Open1035.03017OpenAlexW2115879220MaRDI QIDQ4452455FDOQ4452455
Publication date: 12 February 2004
Published in: Mathematical Logic Quarterly (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/malq.200310066
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Categoricity and completeness of theories (03C35) Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45) Complexity of computation (including implicit computational complexity) (03D15)
Cited In (18)
- Relativizing computable categoricity
- Finite computable dimension and degrees of categoricity
- 2010 North American Annual Meeting of the Association for Symbolic Logic
- Degrees of autostability relative to strong constructivizations for Boolean algebras
- Complexity of categorical theories with computable models
- Degrees of autostability for linear orders and linearly ordered abelian groups
- Categoricity spectra of computable structures
- Scott sentences for certain groups
- Computable numberings of the class of Boolean algebras with distinguished endomorphisms
- Categoricity properties for computable algebraic fields
- Computability-Theoretic Complexity of Countable Structures
- Index sets for classes of high rank structures
- Preserving categoricity and complexity of relations
- The complexity of computable categoricity
- Index sets for some classes of structures
- Computable categoricity of trees of finite height
- Decomposing the complexity quotient category
- Fundamentals of Computation Theory
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)
