Categoricity for primitive recursive and polynomial Boolean algebras (Q1731520): Difference between revisions

@@ Property / cites work @@
+Existence and uniqueness of structures computable in polynomial time
+Normal rank
@@ Property / cites work @@
+Structures computable in polynomial time. I
@@ Property / cites work: Structures computable in polynomial time. I / rank @@
+Normal rank
@@ Property / cites work @@
+Q4249365
@@ Property / cites work: Q4249365 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4005059
@@ Property / cites work: Q4005059 / rank @@
+Normal rank
@@ Property / cites work @@
+Algebraic structures computable without delay
@@ Property / cites work: Algebraic structures computable without delay / rank @@
+Normal rank
@@ Property / cites work @@
+Autostability of models
@@ Property / cites work: Autostability of models / rank @@
+Normal rank
@@ Property / cites work @@
+Recursive isomorphism types of recursive Boolean algebras
+Normal rank
@@ Property / cites work @@
+Autostability and computable families of constructivizations
+Normal rank
@@ Property / cites work @@
+Polynomial-time Abelian groups
@@ Property / cites work: Polynomial-time Abelian groups / rank @@
+Normal rank
@@ Property / cites work @@
+Q4895321
@@ Property / cites work: Q4895321 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4091421
@@ Property / cites work: Q4091421 / rank @@
+Normal rank
@@ Property / cites work @@
+Some properties of the constructivization of Boolean algebras
+Normal rank
@@ Property / cites work @@
+Complexity and categoricity
@@ Property / cites work: Complexity and categoricity / rank @@
+Normal rank
@@ Property / cites work @@
+Polynomial-time versus recursive models
@@ Property / cites work: Polynomial-time versus recursive models / rank @@
+Normal rank