- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
Enumeration Reducibility Using Bounded Information: Counting Minimal Covers
Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 33 (6):537-560 (1987)
Abstract
This article has no associated abstract. (fix it)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.
Enumeration of some classes of recursively enumerable sets.Kempachiro Ohashi - 1964 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 10 (1):1-6.
Axt Paul. Enumeration and the Grzegorczyk hierarchy. Zeitschrift für mathematische Logik und Grundlagen der Mathematik, Bd. 9 , S. 53–65. [REVIEW]Rózsa Péter - 1965 - Journal of Symbolic Logic 30 (1):90-91.
Analytics
Added to PP
2015-12-02
Downloads
33 (#687,522)
6 months
3 (#1,473,720)
2015-12-02
Downloads
33 (#687,522)
6 months
3 (#1,473,720)
Historical graph of downloads
Citations of this work
Cupping and noncupping in the enumeration degrees of ∑20 sets.S. Barry Cooper, Andrea Sorbi & Xiaoding Yi - 1996 - Annals of Pure and Applied Logic 82 (3):317-342.
Strong Enumeration Reducibilities.Roland Sh Omanadze & Andrea Sorbi - 2006 - Archive for Mathematical Logic 45 (7):869-912.
Bounded query classes and the difference hierarchy.Richard Beigel, William I. Gasarch & Louise Hay - 1989 - Archive for Mathematical Logic 29 (2):69-84.
Bounded enumeration reducibility and its degree structure.Daniele Marsibilio & Andrea Sorbi - 2012 - Archive for Mathematical Logic 51 (1-2):163-186.
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.
References found in this work
Theory of recursive functions and effective computability.Hartley Rogers - 1987 - Cambridge: MIT Press.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-667477cd97-lv8mh dc2