On the complexity of categoricity in computable structures

DOI10.1002/malq.200310066zbMath1035.03017OpenAlexW2115879220MaRDI QIDQ4452455

Walker M. White

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

zbMATH Keywords

categorical structureScott familyComputable structurehyperarithmetic categoricity

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45) Categoricity and completeness of theories (03C35)

Related Items (10)

Degrees of autostability relative to strong constructivizations for Boolean algebras ⋮ Degrees of autostability for linear orders and linearly ordered abelian groups ⋮ Computable numberings of the class of Boolean algebras with distinguished endomorphisms ⋮ The complexity of computable categoricity ⋮ Scott sentences for certain groups ⋮ Index sets for classes of high rank structures ⋮ Computable categoricity of trees of finite height ⋮ Index sets for some classes of structures ⋮ 2010 North American Annual Meeting of the Association for Symbolic Logic ⋮ Categoricity properties for computable algebraic fields

This page was built for publication: On the complexity of categoricity in computable structures