- 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
On minimal pairs of enumeration degrees
Journal of Symbolic Logic 50 (4):983-1001 (1985)
Abstract
This article has no associated abstract. (fix it)Links
PhilArchive
External links
(no proxy)
Setup an account with your affiliations in order to access resources via your University's proxy server
Through your library
- Sign in / register and customize your OpenURL resolver
- Configure custom resolver
My notes
Similar books and articles
Jumps of quasi-minimal enumeration degrees.Kevin McEvoy - 1985 - Journal of Symbolic Logic 50 (3):839-848.
The Π₃-Theory of the $\Sigma _{2}^{0}$ -Enumeration Degrees Is Undecidable.Thomas F. Kent - 2006 - Journal of Symbolic Logic 71 (4):1284 - 1302.
Noncappable enumeration degrees below 0'e. [REVIEW]S. Barry Cooper & Andrea Sorbi - 1996 - Journal of Symbolic Logic 61 (4):1347 - 1363.
Minimal pairs and high recursively enumerable degrees.S. B. Cooper - 1974 - Journal of Symbolic Logic 39 (4):655-660.
Partial degrees and the density problem. Part 2: The enumeration degrees of the ∑2 sets are dense.S. B. Cooper - 1984 - Journal of Symbolic Logic 49 (2):503 - 513.
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.
Analytics
Added to PP
2009-01-28
Downloads
216 (#88,744)
6 months
1 (#1,428,112)
2009-01-28
Downloads
216 (#88,744)
6 months
1 (#1,428,112)
Historical graph of downloads
Citations of this work
Strong Enumeration Reducibilities.Roland Sh Omanadze & Andrea Sorbi - 2006 - Archive for Mathematical Logic 45 (7):869-912.
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.
Goodness in the enumeration and singleton degrees.Charles M. Harris - 2010 - Archive for Mathematical Logic 49 (6):673-691.
Limit lemmas and jump inversion in the enumeration degrees.Evan J. Griffiths - 2003 - Archive for Mathematical Logic 42 (6):553-562.
A jump inversion theorem for the enumeration jump.I. N. Soskov - 2000 - Archive for Mathematical Logic 39 (6):417-437.
References found in this work
Theory of Recursive Functions and Effective Computability.Hartley Rogers - 1971 - Journal of Symbolic Logic 36 (1):141-146.
Enumeration reducibility and partial degrees.John Case - 1971 - Annals of Mathematical Logic 2 (4):419-439.
Sublattices of the Recursively Enumerable Degrees.S. K. Thomason - 1971 - Mathematical Logic Quarterly 17 (1):273-280.
Sublattices of the Recursively Enumerable Degrees.S. K. Thomason - 1971 - Mathematical Logic Quarterly 17 (1):273-280.
Recursively Enumerable Sets and Degrees. A Study of Computable Functions and Computably Generated Sets.Robert I. Soare - 1990 - Journal of Symbolic Logic 55 (1):356-357.
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-6d9b7f7c4c-v4fj8 uwo