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 [Book Review]

Journal of Symbolic Logic 58 (1):359-360 (1993)

Abstract This article has no associated abstract. (fix it)
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.2307/2275349
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

Our Archive

Upload a copy of this paper     Check publisher's policy     Papers currently archived: 46,206
External links

Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library

References found in this work BETA

No references found.

Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles

Nondeterministic Bounded Query Reducibilities.Richard Beigel, William Gasarch & Jim Owings - 1989 - Annals of Pure and Applied Logic 41 (2):107-118.
Effective Search Problems.Martin Kummer & Frank Stephan - 1994 - Mathematical Logic Quarterly 40 (2):224-236.
Intrinsic Reducibilities.Timothy H. McNicholl - 2000 - Mathematical Logic Quarterly 46 (3):393-407.
The Polynomial and Linear Time Hierarchies in V0.Leszek A. Kołodziejczyk & Neil Thapen - 2009 - Mathematical Logic Quarterly 55 (5):509-514.
The Hausdorff-Ershov Hierarchy in Euclidean Spaces.Armin Hemmerling - 2005 - Archive for Mathematical Logic 45 (3):323-350.
Preservation Theorems for Bounded Formulas.Morteza Moniri - 2007 - Archive for Mathematical Logic 46 (1):9-14.


Added to PP index

Total views
20 ( #460,397 of 2,285,688 )

Recent downloads (6 months)
9 ( #107,211 of 2,285,688 )

How can I increase my downloads?


My notes

Sign in to use this feature