Nondeterministic bounded query reducibilities

, &
Annals of Pure and Applied Logic 41 (2):107-118 (1989)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/0168-0072(89)90010-9

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,386

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

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.
Intrinsic Reducibilities.Timothy H. McNicholl - 2000 - Mathematical Logic Quarterly 46 (3):393-407.
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
2014-01-16

Downloads
15 (#923,100)

6 months
4 (#790,687)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

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.

Add more citations

References found in this work

A Theorem on Hypersimple Sets.J. C. E. Dekker - 1956 - Journal of Symbolic Logic 21 (1):100-100.

Add more references