The complexity of computable categoricity
From MaRDI portal
Publication:471691
DOI10.1016/j.aim.2014.09.022zbMath1345.03063OpenAlexW2009042084MaRDI QIDQ471691
Steffen Lempp, Andrew E. M. Lewis-Pye, Antonio Montalbán, Asher M. Kach, Rodney G. Downey, Daniel D. Turetsky
Publication date: 17 November 2014
Published in: Advances in Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.aim.2014.09.022
Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45) Computability and recursion theory on ordinals, admissible sets, etc. (03D60) Categoricity and completeness of theories (03C35)
Related Items
The index set of the groups autostable relative to strong constructivizations ⋮ \(\prod_1^1\)-completeness of the computable categoricity problem for projective planes ⋮ AN INTRODUCTION TO THE SCOTT COMPLEXITY OF COUNTABLE STRUCTURES AND A SURVEY OF RECENT RESULTS ⋮ THE TREE OF TUPLES OF A STRUCTURE ⋮ There is no classification of the decidably presentable structures ⋮ On a question of Kalimullin ⋮ Torsion-free abelian groups with optimal Scott families ⋮ Computable torsion abelian groups ⋮ Computable Heyting algebras with distinguished atoms and coatoms ⋮ Index sets for \(n\)-decidable structures categorical relative to \(m\)-decidable presentations ⋮ A note on decidable categoricity and index sets ⋮ Index sets of autostable relative to strong constructivizations constructive models for familiar classes ⋮ A Note on Effective Categoricity for Linear Orderings ⋮ Computable bi-embeddable categoricity ⋮ HKSS-completeness of modal algebras ⋮ A COMPUTABLE FUNCTOR FROM GRAPHS TO FIELDS ⋮ On the virtue of categoricity ⋮ Categoricity spectra for polymodal algebras ⋮ DEGREES OF CATEGORICITY ON A CONE VIAη-SYSTEMS ⋮ Punctual categoricity relative to a computable oracle ⋮ Punctual definability on structures ⋮ Categoricity spectra of computable structures ⋮ AUTOMATIC AND POLYNOMIAL-TIME ALGEBRAIC STRUCTURES ⋮ FOUNDATIONS OF ONLINE STRUCTURE THEORY ⋮ Categorical linearly ordered structures ⋮ Coding in the automorphism group of a computably categorical structure ⋮ Degrees of bi-embeddable categoricity ⋮ Relativizing computable categoricity ⋮ PUNCTUAL CATEGORICITY AND UNIVERSALITY ⋮ Индексное множество автоустойчивых упорядоченных абелевых групп
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The isomorphism problem for torsion-free abelian groups is analytic complete
- Autostability of models and Abelian groups
- Autostability of models
- Computable structures and the hyperarithmetical hierarchy
- Categoricity in hyperarithmetical degrees
- The computable dimension of ordered abelian groups
- Subspaces of computable vector spaces
- Enumerations in computable structure theory
- Computably Categorical Fields via Fermat’s Last Theorem
- Effective procedures in field theory
- Computable categoricity of trees of finite height
- Intrinsic bounds on complexity and definability at limit levels
- Computable Categoricity of Graphs with Finite Components
- On the complexity of categoricity in computable structures
- Computable categoricity versus relative computable categoricity
- CONSTRUCTIVE ALGEBRAS I
- Computable Algebra, General Theory and Theory of Computable Fields
- Intrinsically Hyperarithmetical Sets
- Incompleteness along paths in progressions of theories
