- 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
Nondeterministic bounded query reducibilities
Annals of Pure and Applied Logic 41 (2):107-118 (1989)
Abstract
This article has no associated abstract. (fix it)My notes
Similar books and articles
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.
Review: Richard Beigel, William I. Gasarch, Louise Hay, Bounded Query Classes and the Difference Hierarchy. [REVIEW]Melven Krom - 1993 - Journal of Symbolic Logic 58 (1):359-360.
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.
Effective Search Problems.Martin Kummer & Frank Stephan - 1994 - Mathematical Logic Quarterly 40 (2):224-236.
On sparseness, reducibilities, and complexity.Felipe Cucker - 2005 - Annals of Pure and Applied Logic 134 (1):53-61.
Downey, R., Gasarch, W. and Moses, M., The structure.S. D. Friedman, W. G. Handley, S. S. Wainer, A. Joyal, I. Moerdijk, L. Newelski, F. van Engelen & J. van Oosten - 1994 - Annals of Pure and Applied Logic 70 (1):287.
Erratum to “Ordinal notations and well-orderings in bounded arithmetic” [Annals of Pure and Applied Logic 120 (2003) 197–223]. [REVIEW]Arnold Beckmann, Samuel R. Buss & Chris Pollett - 2003 - Annals of Pure and Applied Logic 123 (1-3):291.
On bounded functional interpretations.Gilda Ferreira & Paulo Oliva - 2012 - Annals of Pure and Applied Logic 163 (8):1030-1049.
Bounded stationary reflection II.Chris Lambie-Hanson - 2017 - Annals of Pure and Applied Logic 168 (1):50-71.
Analytics
Added to PP
2014-01-16
Downloads
18 (#860,222)
6 months
7 (#491,177)
2014-01-16
Downloads
18 (#860,222)
6 months
7 (#491,177)
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.
Weakly semirecursive sets.Carl G. Jockusch & James C. Owings - 1990 - Journal of Symbolic Logic 55 (2):637-644.
On the structures inside truth-table degrees.Frank Stephan - 2001 - Journal of Symbolic Logic 66 (2):731-770.
References found in 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.
Bounded query classes and the difference hierarchy.Richard Beigel, William I. Gasarch & Louise Hay - 1989 - Archive for Mathematical Logic 29 (2):69-84.
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-68866f4b87-kfj6z uwo