Enumeration Reducibility Using Bounded Information: Counting Minimal Covers


Abstract This article has no associated abstract. (fix it)
Keywords No keywords specified (fix it)
Categories No categories specified
(categorize this paper)
DOI 10.1002/malq.19870330608
Options
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: 40,683
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

Add more references

Citations of this work BETA

Strong Enumeration Reducibilities.Roland Sh Omanadze & Andrea Sorbi - 2006 - Archive for Mathematical Logic 45 (7):869-912.
Bounded Enumeration Reducibility and its Degree Structure.Daniele Marsibilio & Andrea Sorbi - 2012 - Archive for Mathematical Logic 51 (1-2):163-186.

View all 11 citations / Add more citations

Similar books and articles

Bounded Enumeration Reducibility and its Degree Structure.Daniele Marsibilio & Andrea Sorbi - 2012 - Archive for Mathematical Logic 51 (1-2):163-186.
On Nondeterminism, Enumeration Reducibility and Polynomial Bounds.Kate Copestake - 1997 - Mathematical Logic Quarterly 43 (3):287-310.
On the Symmetric Enumeration Degrees.Charles M. Harris - 2007 - Notre Dame Journal of Formal Logic 48 (2):175-204.
A Jump Inversion Theorem for the Enumeration Jump.I. N. Soskov - 2000 - Archive for Mathematical Logic 39 (6):417-437.
Strong Enumeration Reducibilities.Roland Sh Omanadze & Andrea Sorbi - 2006 - Archive for Mathematical Logic 45 (7):869-912.
Approximate Counting by Hashing in Bounded Arithmetic.Emil Jeřábek - 2009 - Journal of Symbolic Logic 74 (3):829-860.
Noncappable Enumeration Degrees Below 0'e. [REVIEW]S. Barry Cooper & Andrea Sorbi - 1996 - Journal of Symbolic Logic 61 (4):1347 - 1363.
Exact Pairs for Abstract Bounded Reducibilities.Wolfgang Merkle - 1999 - Mathematical Logic Quarterly 45 (3):343-360.
Embeddings in the Strong Reducibilities Between 1 and Npm.Phil Watson - 1997 - Mathematical Logic Quarterly 43 (4):559-568.
On Minimal Pairs of Enumeration Degrees.Kevin McEvoy & S. Barry Cooper - 1985 - Journal of Symbolic Logic 50 (4):983-1001.

Analytics

Added to PP index
2015-12-02

Total views
17 ( #474,810 of 2,242,823 )

Recent downloads (6 months)
1 ( #1,043,126 of 2,242,823 )

How can I increase my downloads?

Downloads

My notes

Sign in to use this feature