- 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)My notes
Similar books and articles
Some natural decision problems in automatic graphs.Dietrich Kuske & Markus Lohrey - 2010 - Journal of Symbolic Logic 75 (2):678-710.
The relation of recursive isomorphism for countable structures.Riccardo Camerlo - 2002 - Journal of Symbolic Logic 67 (2):879-895.
Directed cyclic graphs, conditional independence, and non-recursive linear structural equation models.Peter Spirtes - unknown
On the contrapositive of countable choice.Hajime Ishihara & Peter Schuster - 2011 - Archive for Mathematical Logic 50 (1-2):137-143.
Expansions of Ultrahomogeneous Graphs.J. E. Helmreich - 1995 - Notre Dame Journal of Formal Logic 36 (3):414-424.
Isomorphism of Homogeneous Structures.John D. Clemens - 2009 - Notre Dame Journal of Formal Logic 50 (1):1-22.
0-1 laws for recursive structures.E. Grädel & A. Malmström - 1999 - Archive for Mathematical Logic 38 (4-5):205-215.
Graphs with ∏ 1 0 (K)Y-sections.Boško Živaljević - 1993 - Archive for Mathematical Logic 32 (4):259-273.
Nonuniformization results for the projective hierarchy.Steve Jackson & R. Daniel Mauldin - 1991 - Journal of Symbolic Logic 56 (2):742-748.
Automorphisms of Countable Short Recursively Saturated Models of PA.Erez Shochat - 2008 - Notre Dame Journal of Formal Logic 49 (4):345-360.
The f-factor Problem for Graphs and the Hereditary Property.Frank Niedermeyer, Saharon Shelah & Karsten Steffens - 2006 - Archive for Mathematical Logic 45 (6):665-672.
Countable Fréchetα 1-spaces may be first countable.Alan Dow & Juris Stepräns - 1992 - Archive for Mathematical Logic 32 (1):33-50.
Analytic equivalence relations and bi-embeddability.Sy-David Friedman & Luca Motto Ros - 2011 - Journal of Symbolic Logic 76 (1):243 - 266.
Analytics
Added to PP
2014-01-16
Downloads
16 (#880,136)
6 months
5 (#652,053)
2014-01-16
Downloads
16 (#880,136)
6 months
5 (#652,053)
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-7c76586df8-5tf24 uwo