The complexity of computable categoricity (Q471691): Difference between revisions

@@ Property / cites work @@
+Categoricity in hyperarithmetical degrees
@@ Property / cites work: Categoricity in hyperarithmetical degrees / rank @@
+Normal rank
@@ Property / cites work @@
+Computable structures and the hyperarithmetical hierarchy
+Normal rank
@@ Property / cites work @@
+Intrinsic bounds on complexity and definability at limit levels
+Normal rank
@@ Property / cites work @@
+Computable Categoricity of Graphs with Finite Components
+Normal rank
@@ Property / cites work @@
+Q4677706
@@ Property / cites work: Q4677706 / rank @@
+Normal rank
@@ Property / cites work @@
+The isomorphism problem for torsion-free abelian groups is analytic complete
+Normal rank
@@ Property / cites work @@
+Subspaces of computable vector spaces
@@ Property / cites work: Subspaces of computable vector spaces / rank @@
+Normal rank
@@ Property / cites work @@
+Computable categoricity versus relative computable categoricity
+Normal rank
@@ Property / cites work @@
+Incompleteness along paths in progressions of theories
+Normal rank
@@ Property / cites work @@
+Effective procedures in field theory
@@ Property / cites work: Effective procedures in field theory / rank @@
+Normal rank
@@ Property / cites work @@
+Q4143289
@@ Property / cites work: Q4143289 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4190617
@@ Property / cites work: Q4190617 / rank @@
+Normal rank
@@ Property / cites work @@
+Autostability of models
@@ Property / cites work: Autostability of models / rank @@
+Normal rank
@@ Property / cites work @@
+Autostability of models and Abelian groups
@@ Property / cites work: Autostability of models and Abelian groups / rank @@
+Normal rank
@@ Property / cites work @@
+Enumerations in computable structure theory
@@ Property / cites work: Enumerations in computable structure theory / rank @@
+Normal rank
@@ Property / cites work @@
+The computable dimension of ordered abelian groups
+Normal rank
@@ Property / cites work @@
+Computable categoricity of trees of finite height
@@ Property / cites work: Computable categoricity of trees of finite height / rank @@
+Normal rank
@@ Property / cites work @@
+CONSTRUCTIVE ALGEBRAS I
@@ Property / cites work: CONSTRUCTIVE ALGEBRAS I / rank @@
+Normal rank
@@ Property / cites work @@
+Q5537372
@@ Property / cites work: Q5537372 / rank @@
+Normal rank
@@ Property / cites work @@
+Computably Categorical Fields via Fermat’s Last Theorem
+Normal rank
@@ Property / cites work @@
+Computable Algebra, General Theory and Theory of Computable Fields
+Normal rank
@@ Property / cites work @@
+Q3949039
@@ Property / cites work: Q3949039 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4040892
@@ Property / cites work: Q4040892 / rank @@
+Normal rank
@@ Property / cites work @@
+Intrinsically Hyperarithmetical Sets
@@ Property / cites work: Intrinsically Hyperarithmetical Sets / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of categoricity in computable structures
+Normal rank