Recursive coloration of countable graphs (Q595648): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/0168-0072(83)90052-0
+Normal rank
@@ Property / OpenAlex ID @@
+W2008839847
@@ Property / OpenAlex ID: W2008839847 / rank @@
+Normal rank
@@ Property / cites work @@
+Effective coloration
@@ Property / cites work: Effective coloration / rank @@
+Normal rank
@@ Property / cites work @@
+Q4128521
@@ Property / cites work: Q4128521 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5782525
@@ Property / cites work: Q5782525 / rank @@
+Normal rank
@@ Property / cites work @@
+Π<sub>1</sub><sup>0</sup> classes and Boolean combinations of recursively enumerable sets
+Normal rank
@@ Property / cites work @@
+Nonrecursive tilings of the plane. II
@@ Property / cites work: Nonrecursive tilings of the plane. II / rank @@
+Normal rank
@@ Property / cites work @@
+On a system of axioms which has no recursively enumerable arithmetic model
+Normal rank
@@ Property / cites work @@
+Q5573961
@@ Property / cites work: Q5573961 / rank @@
+Normal rank