Annals of Pure and Applied Logic 41 (2):107-118 (1989)
Abstract | This article has no associated abstract. (fix it) |
Keywords | No keywords specified (fix it) |
Categories | (categorize this paper) |
DOI | 10.1016/0168-0072(89)90010-9 |
Options |
![]() ![]() ![]() ![]() |
Download options
References found in this work BETA
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.
Bounded Query Classes and the Difference Hierarchy.Richard Beigel, William I. Gasarch & Louise Hay - 1989 - Archive for Mathematical Logic 29 (2):69-84.
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.
Citations of this work BETA
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.
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.
Exact Pairs for Abstract Bounded Reducibilities.Wolfgang Merkle - 1999 - Mathematical Logic Quarterly 45 (3):343-360.
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.
Separations by Random Oracles and "Almost" Classes for Generalized Reducibilities.Y. Wang & W. Merkle - 2001 - Mathematical Logic Quarterly 47 (2):249-270.
Bounded Truth Table Does Not Reduce the One-Query Tautologies to a Random Oracle.Toshio Suzuki - 2005 - Archive for Mathematical Logic 44 (6):751-762.
Bounded Immunity and Btt‐Reductions.Stephen Fenner & Marcus Schaefer - 1999 - Mathematical Logic Quarterly 45 (1):3-21.
A Theory for Log-Space and NLIN Versus Co-NLIN.Chris Pollett - 2003 - Journal of Symbolic Logic 68 (4):1082-1090.
On Existence of Complete Sets for Bounded Reducibilities.Valeriy Bulitko & Vadim Bulitko - 2003 - Mathematical Logic Quarterly 49 (6):567-575.
Bounded Query Classes and the Difference Hierarchy.Richard Beigel, William I. Gasarch & Louise Hay - 1989 - Archive for Mathematical Logic 29 (2):69-84.
Baire Reductions and Good Borel Reducibilities.Luca Motto Ros - 2010 - Journal of Symbolic Logic 75 (1):323-345.
Immunity Properties and Strong Positive Reducibilities.Irakli O. Chitaia, Roland Sh Omanadze & Andrea Sorbi - 2011 - Archive for Mathematical Logic 50 (3-4):341-352.
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.
Nondeterministic Three-Valued Logic: Isotonic and Guarded Truth-Functions.Peter Päppinghaus & Martin Wirsing - 1983 - Studia Logica 42 (1):1 - 22.
Analytics
Added to PP index
2014-01-16
Total views
10 ( #903,150 of 2,518,486 )
Recent downloads (6 months)
1 ( #408,186 of 2,518,486 )
2014-01-16
Total views
10 ( #903,150 of 2,518,486 )
Recent downloads (6 months)
1 ( #408,186 of 2,518,486 )
How can I increase my downloads?
Downloads