- 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
On the complexity of finding the chromatic number of a recursive graph I: the bounded case
Annals of Pure and Applied Logic 45 (1):1-38 (1989)
Abstract
This article has no associated abstract. (fix it)Other Versions
No versions found
My notes
Similar books and articles
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.
Filter spaces: towards a unified theory of large cardinal and embedding axioms BEIGEL, R., GASARCH, W. and OWINGS, J., Nondeterministic bounded query reducibilities. [REVIEW]A. Apter, C. Diprisco, J. Henle & W. Zwicker - 1989 - Annals of Pure and Applied Logic 41:299.
Richard Beigel, William I. Gasarch, and Louise Hay. Bounded query classes and the difference hierarchy. Archive for mathematical logic, vol. 29 no. 2 , pp. 69–84. [REVIEW]Melven Krom - 1993 - Journal of Symbolic Logic 58 (1):359-360.
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.
Graph colorings and recursively bounded Π10-classes.J. B. Remmel - 1986 - Annals of Pure and Applied Logic 32:185-194.
Effective Search Problems.Martin Kummer & Frank Stephan - 1994 - Mathematical Logic Quarterly 40 (2):224-236.
Descriptive complexity of graph spectra.Anuj Dawar, Simone Severini & Octavio Zapata - 2019 - Annals of Pure and Applied Logic 170 (9):993-1007.
Ramsey, expanders, and Borel chromatic numbers.Jan Grebík & Zoltán Vidnyánszky - forthcoming - Journal of Mathematical Logic.
Analytics
Added to PP
2014-01-16
Downloads
30 (#727,792)
6 months
7 (#639,774)
2014-01-16
Downloads
30 (#727,792)
6 months
7 (#639,774)
Historical graph of downloads
Citations of this work
Index sets for Π01 classes.Douglas Cenzer & Jeffrey Remmel - 1998 - Annals of Pure and Applied Logic 93 (1-3):3-61.
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.
Nondeterministic bounded query reducibilities.Richard Beigel, William Gasarch & Jim Owings - 1989 - Annals of Pure and Applied Logic 41 (2):107-118.
Infinite Versions of Some Problems from Finite Complexity Theory.Jeffry L. Hirst & Steffen Lempp - 1996 - Notre Dame Journal of Formal Logic 37 (4):545-553.
Index sets for< i> Π_< sup> 0< sub> 1 classes.Douglas Cenzer & Jeffrey Remmel - 1998 - Annals of Pure and Applied Logic 93 (1):3-61.
References found in this work
Recursive coloration of countable graphs.Hans-Georg Carstens & Peter Päppinghaus - 1983 - Annals of Pure and Applied Logic 25 (1):19-45.
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.
Nondeterministic bounded query reducibilities.Richard Beigel, William Gasarch & Jim Owings - 1989 - Annals of Pure and Applied Logic 41 (2):107-118.
A cardinality version of biegel's nonspeedup theorem.James C. Owings - 1989 - Journal of Symbolic Logic 54 (3):761-767.
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-6f97f49787-zrclg uwo