- 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
Degrees which do not bound minimal degrees
Annals of Pure and Applied Logic 30 (3):249-276 (1986)
Abstract
This article has no associated abstract. (fix it)My notes
Similar books and articles
A Hyperimmune Minimal Degree and an ANR 2-Minimal Degree.Mingzhong Cai - 2010 - Notre Dame Journal of Formal Logic 51 (4):443-455.
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.
A high c.e. degree which is not the join of two minimal degrees.Matthew B. Giorgi - 2010 - Journal of Symbolic Logic 75 (4):1339-1358.
Infima of d.r.e. degrees.Jiang Liu, Shenling Wang & Guohua Wu - 2010 - Archive for Mathematical Logic 49 (1):35-49.
Minimality in the $triangle^1_3$-Degrees.Philip Welch - 1987 - Journal of Symbolic Logic 52 (4):908-915.
Wtt-degrees and t-degrees of R.e. Sets.Michael Stob - 1983 - Journal of Symbolic Logic 48 (4):921-930.
Discontinuity of Cappings in the Recursively Enumerable Degrees and Strongly Nonbranching Degrees.Klaus Ambos-Spies & Ding Decheng - 1994 - Mathematical Logic Quarterly 40 (3):287-317.
Properly Σ2 minimal degrees and 0″ complementation.S. Barry Cooper, Andrew E. M. Lewis & Yue Yang - 2005 - Mathematical Logic Quarterly 51 (3):274-276.
Bounding minimal degrees by computably enumerable degrees.Angsheng Li & Dongping Yang - 1998 - Journal of Symbolic Logic 63 (4):1319-1347.
On the very idea of degrees of truth.Timothy Cleveland - 1997 - Australasian Journal of Philosophy 75 (2):218 – 221.
Characterizing the Join-Irreducible Medvedev Degrees.Paul Shafer - 2011 - Notre Dame Journal of Formal Logic 52 (1):21-38.
On a problem of Cooper and Epstein.Shamil Ishmukhametov - 2003 - Journal of Symbolic Logic 68 (1):52-64.
Randomness, Lowness and Degrees.George Barmpalias, Andrew E. M. Lewis & Mariya Soskova - 2008 - Journal of Symbolic Logic 73 (2):559 - 577.
Analytics
Added to PP
2014-01-16
Downloads
12 (#1,058,801)
6 months
6 (#504,917)
2014-01-16
Downloads
12 (#1,058,801)
6 months
6 (#504,917)
Historical graph of downloads
Citations of this work
A 1-generic degree with a strong minimal cover.Masahiro Kumabe - 2000 - Journal of Symbolic Logic 65 (3):1395-1442.
Generic degrees are complemented.Masahiro Kumabe - 1993 - Annals of Pure and Applied Logic 59 (3):257-272.
Σ5-completeness of index sets arising from the recursively enumerable Turing degrees.Michael A. Jahn - 1996 - Annals of Pure and Applied Logic 79 (2):109-137.
Highness, locally noncappability and nonboundings.Frank Stephan & Guohua Wu - 2013 - Annals of Pure and Applied Logic 164 (5):511-522.
Bounding minimal degrees by computably enumerable degrees.Angsheng Li & Dongping Yang - 1998 - Journal of Symbolic Logic 63 (4):1319-1347.
References found in this work
Double Jumps of Minimal Degrees.Carl G. Jockusch & David B. Posner - 1978 - Journal of Symbolic Logic 43 (4):715 - 724.
Minimal degrees and the jump operator.S. B. Cooper - 1973 - Journal of Symbolic Logic 38 (2):249-271.
A minimal degree not realizing least possible jump.Leonard P. Sasso - 1974 - Journal of Symbolic Logic 39 (3):571-574.
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-7c76586df8-pp8v9 uwo