The complexity of countable categoricity in finite languages (Q3117785): Difference between revisions

@@ Property / DOI @@
-.1002/malq.201110035
@@ Property / DOI: 10.1002/malq.201110035 / rank @@
-Normal rank
@@ Property / OpenAlex ID @@
+W1969902453
@@ Property / OpenAlex ID: W1969902453 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.3792
@@ Property / arXiv ID: 1101.3792 / rank @@
+Normal rank
@@ Property / cites work @@
+GALOIS GROUPS OF FIRST ORDER THEORIES
@@ Property / cites work: GALOIS GROUPS OF FIRST ORDER THEORIES / rank @@
+Normal rank
@@ Property / cites work @@
+On many-sorted ω-categorical theories
@@ Property / cites work: On many-sorted ω-categorical theories / rank @@
+Normal rank
@@ Property / cites work @@
+A countably categorical theory which is not \(G\)-compact
+Normal rank
@@ Property / cites work @@
+On generic structures
@@ Property / cites work: On generic structures / rank @@
+Normal rank
@@ Property / cites work @@
+The diameter of a Lascar strong type
@@ Property / cites work: The diameter of a Lascar strong type / rank @@
+Normal rank
@@ Property / cites work @@
+A decidable Ehrenfeucht theory with exactly two hyperarithmetic models
+Normal rank
@@ Property / cites work @@
+A decidable $ℵ_0$-categorical theory with a non-recursive Ryll-Nardzewski function
+Normal rank
@@ Property / DOI @@
+.1002/MALQ.201110035
@@ Property / DOI: 10.1002/MALQ.201110035 / rank @@
+Normal rank