- 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
Nonbounding and Slaman triples
Annals of Pure and Applied Logic 79 (2):139-163 (1996)
Abstract
We consider the relationship of the lattice-theoretic properties and the jump-theoretic properties satisfied by a recursively enumerable Turing degree. The existence is shown of a high2 r.e. degree which does not bound what we call the base of any Slaman tripleOther Versions
No versions found
My notes
Similar books and articles
The existence of high nonbounding degrees in the difference hierarchy.Chi Tat Chong, Angsheng Li & Yue Yang - 2006 - Annals of Pure and Applied Logic 138 (1):31-51.
Lattice nonembeddings and intervals of the recursively enumerable degrees.Peter Cholak & Rod Downey - 1993 - Annals of Pure and Applied Logic 61 (3):195-221.
On the Jumps of the Degrees Below a Recursively Enumerable Degree.David R. Belanger & Richard A. Shore - 2018 - Notre Dame Journal of Formal Logic 59 (1):91-107.
Highness, locally noncappability and nonboundings.Frank Stephan & Guohua Wu - 2013 - Annals of Pure and Applied Logic 164 (5):511-522.
Recursively enumerable generic sets.Wolfgang Maass - 1982 - Journal of Symbolic Logic 47 (4):809-823.
The discontinuity of splitting in the recursively enumerable degrees.S. Barry Cooper & Xiaoding Yi - 1995 - Archive for Mathematical Logic 34 (4):247-256.
There is no fat orbit.Rod Downey & Leo Harrington - 1996 - Annals of Pure and Applied Logic 80 (3):277-289.
Decidability of the two-quantifier theory of the recursively enumerable weak truth-table degrees and other distributive upper semi-lattices.Klaus Ambos-Spies, Peter Fejer, Steffen Lempp & Manuel Lerman - 1996 - Journal of Symbolic Logic 61 (3):880-905.
A nonlow2 R. E. Degree with the Extension of Embeddings Properties of a low2 Degree.Richard A. Shore & Yue Yang - 2002 - Mathematical Logic Quarterly 48 (1):131-146.
On the r.e. predecessors of d.r.e. degrees.Shamil Ishmukhametov - 1999 - Archive for Mathematical Logic 38 (6):373-386.
Analytics
Added to PP
2014-01-16
Downloads
53 (#1,123,741)
6 months
10 (#1,167,075)
2014-01-16
Downloads
53 (#1,123,741)
6 months
10 (#1,167,075)
Historical graph of downloads
Citations of this work
Highness and local noncappability.Chengling Fang, Wang Shenling & Guohua Wu - 2012 - In S. Barry Cooper, How the World Computes. pp. 203--211.
Highness, locally noncappability and nonboundings.Frank Stephan & Guohua Wu - 2013 - Annals of Pure and Applied Logic 164 (5):511-522.
References found in this work
Classes of Recursively Enumerable Sets and Degrees of Unsolvability.Donald A. Martin - 1966 - Mathematical Logic Quarterly 12 (1):295-310.
Minimal pairs and high recursively enumerable degrees.S. B. Cooper - 1974 - Journal of Symbolic Logic 39 (4):655-660.
Working below a low2 recursively enumerably degree.Richard A. Shore & Theodore A. Slaman - 1990 - Archive for Mathematical Logic 29 (3):201-211.
Highness and bounding minimal pairs.Rodney G. Downey, Steffen Lempp & Richard A. Shore - 1993 - Mathematical Logic Quarterly 39 (1):475-491.
Working below a high recursively enumerable degree.Richard A. Shore & Theodore A. Slaman - 1993 - Journal of Symbolic Logic 58 (3):824-859.
Try MATCHA Writer if you're interested in citing directly from PhilPapers and certifying your authorship.
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