Enumeration Reducibility Using Bounded Information: Counting Minimal Covers

Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 33 (6):537-560 (1987)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Add categories

Keywords

Reprint years

DOI

10.1002/malq.19870330608

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,227

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

Enumeration Reducibility Using Bounded Information: Counting Minimal Covers.S. Barry Cooper - 1987 - Mathematical Logic Quarterly 33 (6):537-560.
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.
The minimal e-degree problem in fragments of Peano arithmetic.M. M. Arslanov, C. T. Chong, S. B. Cooper & Y. Yang - 2005 - Annals of Pure and Applied Logic 131 (1-3):159-175.
Branching in the $${\Sigma^0_2}$$ -enumeration degrees: a new perspective. [REVIEW]Maria L. Affatato, Thomas F. Kent & Andrea Sorbi - 2008 - Archive for Mathematical Logic 47 (3):221-231.
Bounding and Nonbounding Minimal Pairs in the Enumeration Degrees.S. Barry Cooper, Angsheng Li, Andrea Sorbi & Yue Yang - 2005 - Journal of Symbolic Logic 70 (3):741 - 766.
How Enumeration Reducibility Yields Extended Harrington Non-Splitting.Mariya I. Soskova & S. Barry Cooper - 2008 - Journal of Symbolic Logic 73 (2):634 - 655.
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
2015-12-02

Downloads
25 (#636,202)

6 months
4 (#797,974)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

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 12 citations / Add more citations

References found in this work

Add more references