Enumeration Reducibility Using Bounded Information: Counting Minimal Covers

Mathematical Logic Quarterly 33 (6):537-560 (1987)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1002/malq.19870330608

Other Versions

reprint Cooper, S. Barry (1987) "Enumeration Reducibility Using Bounded Information: Counting Minimal Covers". Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 33(6):537-560

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,139

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

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.
A jump inversion theorem for the enumeration jump.I. N. Soskov - 2000 - Archive for Mathematical Logic 39 (6):417-437.
On Pseudo‐Creative Sets, Splinters, and Bounded‐Truth‐Table Reducibility.Paul R. Young - 1967 - Mathematical Logic Quarterly 13 (1-2):25-31.
S. Barry Cooper, computability theory.Lars Kristiansen - 2007 - Studia Logica 86 (1):145-146.
Enumeration reducibility and partial degrees.John Case - 1971 - Annals of Mathematical Logic 2 (4):419-439.
Strong Enumeration Reducibilities.Roland Sh Omanadze & Andrea Sorbi - 2006 - Archive for Mathematical Logic 45 (7):869-912.
Generalizations of enumeration reducibility using recursive infinitary propositional sentences.C. J. Ash - 1992 - Annals of Pure and Applied Logic 58 (3):173-184.
On MODkP Counting Degrees.Masamitsu Ozaki & Juichi Shinoda - 1999 - Mathematical Logic Quarterly 45 (3):327-342.

Analytics

Added to PP
2013-12-01

Downloads
20 (#1,042,475)

6 months
5 (#1,047,105)

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

References found in this work

Add more references