Recursive coloration of countable graphs
- 31 October 1983
- journal article
- Published by Elsevier in Annals of Pure and Applied Logic
- Vol. 25 (1) , 19-45
- https://doi.org/10.1016/0168-0072(83)90052-0
Abstract
No abstract availableThis publication has 5 references indexed in Scilit:
- Effective colorationThe Journal of Symbolic Logic, 1976
- Nonrecursive tilings of the plane. IIThe Journal of Symbolic Logic, 1974
- Π10 classes and Boolean combinations of recursively enumerable setsThe Journal of Symbolic Logic, 1974
- On a system of axioms which has no recursively enumerable arithmetic modelFundamenta Mathematicae, 1953
- On colouring the nodes of a networkMathematical Proceedings of the Cambridge Philosophical Society, 1941