Recommendations
- Computable categoricity versus relative computable categoricity
- Categoricity properties for computable algebraic fields
- Index sets for \(n\)-decidable structures categorical relative to \(m\)-decidable presentations
- Computability-theoretic categoricity and Scott families
- Degrees of categoricity of computable structures
Cites work
- scientific article; zbMATH DE number 3767640 (Why is no real title available?)
- scientific article; zbMATH DE number 194103 (Why is no real title available?)
- scientific article; zbMATH DE number 3572144 (Why is no real title available?)
- scientific article; zbMATH DE number 3628930 (Why is no real title available?)
- scientific article; zbMATH DE number 2167522 (Why is no real title available?)
- scientific article; zbMATH DE number 3250559 (Why is no real title available?)
- Autostability of models
- Autostability of models and Abelian groups
- CONSTRUCTIVE ALGEBRAS I
- Categoricity in hyperarithmetical degrees
- Computable Algebra, General Theory and Theory of Computable Fields
- Computable Categoricity of Graphs with Finite Components
- Computable categoricity of trees of finite height
- Computable categoricity versus relative computable categoricity
- Computable structures and the hyperarithmetical hierarchy
- Computably categorical fields via Fermat's last theorem
- Effective procedures in field theory
- Enumerations in computable structure theory
- Incompleteness along paths in progressions of theories
- Intrinsic bounds on complexity and definability at limit levels
- Intrinsically Hyperarithmetical Sets
- On the complexity of categoricity in computable structures
- Subspaces of computable vector spaces
- The computable dimension of ordered abelian groups
- The isomorphism problem for torsion-free abelian groups is analytic complete
Cited in
(49)- A note on decidable categoricity and index sets
- HKSS-completeness of modal algebras
- Индексное множество автоустойчивых упорядоченных абелевых групп
- Computable bi-embeddable categoricity
- The branching theorem and computable categoricity in the Ershov hierarchy
- Computable categoricity and the Ershov hierarchy
- Punctual definability on structures
- Computability and categoricity of ultrahomogeneous structures
- On a question of Kalimullin
- Category and Measure in Complexity Classes
- AUTOMATIC AND POLYNOMIAL-TIME ALGEBRAIC STRUCTURES
- There is no classification of the decidably presentable structures
- Fundamentals of Computation Theory
- Torsion-free abelian groups with optimal Scott families
- Index sets for \(n\)-decidable structures categorical relative to \(m\)-decidable presentations
- Computability and categoricity of weakly ultrahomogeneous structures
- Punctual categoricity relative to a computable oracle
- A note on effective categoricity for linear orderings
- Decomposing the complexity quotient category
- \(\prod_1^1\)-completeness of the computable categoricity problem for projective planes
- Computable Heyting algebras with distinguished atoms and coatoms
- Categoricity spectra of computable structures
- FOUNDATIONS OF ONLINE STRUCTURE THEORY
- Solving the Caesar problem without categorical sortals
- The complexity of countable categoricity in finite languages
- On the virtue of categoricity
- Computable categoricity versus relative computable categoricity
- PUNCTUAL CATEGORICITY AND UNIVERSALITY
- Degrees of categoricity on a cone via \(\eta\)-systems
- Finite computable dimension and degrees of categoricity
- Complexity of hyperconcepts
- Complexity of categorical theories with computable models
- Index sets of autostable relative to strong constructivizations constructive models for familiar classes
- Decidable categoricity spectra for almost prime models
- Categoricity of computable infinitary theories
- Categoricity spectra for polymodal algebras
- Coding in the automorphism group of a computably categorical structure
- A computable functor from graphs to fields
- Degrees of bi-embeddable categoricity
- Intrinsic bounds on complexity and definability at limit levels
- Computability-theoretic properties of injection structures
- Categorical linearly ordered structures
- scientific article; zbMATH DE number 1834650 (Why is no real title available?)
- An introduction to the Scott complexity of countable structures and a survey of recent results
- Computable torsion abelian groups
- The tree of tuples of a structure
- The index set of the groups autostable relative to strong constructivizations
- Relativizing computable categoricity
- Categoricity properties for computable algebraic fields
This page was built for publication: The complexity of computable categoricity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q471691)
