- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
Recursive coloration of countable graphs
Annals of Pure and Applied Logic 25 (1):19-45 (1983)
Abstract
This article has no associated abstract. (fix it)Other Versions
No versions found
My notes
Similar books and articles
The computational strength of matchings in countable graphs.Stephen Flood, Matthew Jura, Oscar Levin & Tyler Markkanen - 2022 - Annals of Pure and Applied Logic 173 (8):103133.
On the finiteness of the recursive chromatic number.William I. Gasarch & Andrew C. Y. Lee - 1998 - Annals of Pure and Applied Logic 93 (1-3):73-81.
Hans-Dieter Donder and Peter Koepke. On the consistency strength of ‘accessible’ Jonsson cardinals and of the weak Chang conjecture. Annals of pure and applied logic, vol. 25 , pp. 233–261. - Peter Koepke. Some applications of short core models. Annals of pure and applied logic, vol. 37 , pp. 179–204. [REVIEW]Sy D. Friedman - 1989 - Journal of Symbolic Logic 54 (4):1496-1497.
Recursive categoricity and recursive stability.John N. Crossley, Alfred B. Manaster & Michael F. Moses - 1986 - Annals of Pure and Applied Logic 31:191-204.
A-computable graphs.Matthew Jura, Oscar Levin & Tyler Markkanen - 2016 - Annals of Pure and Applied Logic 167 (3):235-246.
The monadic second-order logic of graphs IV: Definability properties of equational graphs.Bruno Courcelle - 1990 - Annals of Pure and Applied Logic 49 (3):193.
Recursive automorphisms of recursive linear orderings.Steven Schwarz - 1984 - Annals of Pure and Applied Logic 26 (1):69-73.
Interaction graphs: Graphings.Thomas Seiller - 2017 - Annals of Pure and Applied Logic 168 (2):278-320.
Interaction graphs: Additives.Thomas Seiller - 2016 - Annals of Pure and Applied Logic 167 (2):95-154.
Reducts of the Henson graphs with a constant.András Pongrácz - 2017 - Annals of Pure and Applied Logic 168 (7):1472-1489.
Analytics
Added to PP
2014-01-16
Downloads
26 (#854,850)
6 months
9 (#492,507)
2014-01-16
Downloads
26 (#854,850)
6 months
9 (#492,507)
Historical graph of downloads
Citations of this work
On the complexity of finding the chromatic number of a recursive graph I: the bounded case.Richard Beigel & William I. Gasarch - 1989 - Annals of Pure and Applied Logic 45 (1):1-38.
On the complexity of finding the chromatic number of a recursive graph II: the unbounded case.Richard Beigel & William I. Gasarch - 1989 - Annals of Pure and Applied Logic 45 (3):227-246.
Reverse Mathematics and Recursive Graph Theory.William Gasarch & Jeffry L. Hirst - 1998 - Mathematical Logic Quarterly 44 (4):465-473.
A-computable graphs.Matthew Jura, Oscar Levin & Tyler Markkanen - 2016 - Annals of Pure and Applied Logic 167 (3):235-246.
On the finiteness of the recursive chromatic number.William I. Gasarch & Andrew C. Y. Lee - 1998 - Annals of Pure and Applied Logic 93 (1-3):73-81.
References found in this work
Π10 classes and Boolean combinations of recursively enumerable sets.Carl G. Jockusch - 1974 - Journal of Symbolic Logic 39 (1):95-96.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-667477cd97-sfdq8 dc2