Nonbounding and Slaman triples

Annals of Pure and Applied Logic 79 (2):139-163 (1996)
  Copy   BIBTEX

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 triple

Categories

Keywords

Reprint years

DOI

10.1016/0168-0072(95)00044-5

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,853

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

On the Definable Ideal Generated by Nonbounding C.E. Degrees.Liang Yu & Yue Yang - 2005 - Journal of Symbolic Logic 70 (1):252 - 270.
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.
Intervals and sublattices of the r.e. weak truth table degrees, part II: Nonbounding.R. G. Downey - 1989 - Annals of Pure and Applied Logic 44 (3):153-172.
Binary consistent choice on triples.Robert H. Cowen - 1977 - Notre Dame Journal of Formal Logic 18 (2):310-312.
Review: Michael Barr, Charles Wells, Toposes, Triples and Theories. [REVIEW]Andrew Pitts - 1991 - Journal of Symbolic Logic 56 (1):340-341.
A generalization of Sierpiński's theorem on Steiner triples and the axiom of choice.William J. Frascella - 1965 - Notre Dame Journal of Formal Logic 6 (3):163-179.
are Dense.Theodore A. Slaman - 1985 - In Anil Nerode & Richard A. Shore (eds.), Recursion Theory. American Mathematical Society. pp. 42--195.
Totally ω-computably enumerable degrees and bounding critical triples.Rod Downey, Noam Greenberg & Rebecca Weber - 2007 - Journal of Mathematical Logic 7 (2):145-171.
Mathematical definability.Theodore A. Slaman - 1998 - In H. G. Dales & Gianluigi Oliveri (eds.), Truth in Mathematics. Oxford University Press, Usa. pp. 233.
Completely mitotic R.E. degrees.R. G. Downey & T. A. Slaman - 1989 - Annals of Pure and Applied Logic 41 (2):119-152.
Definability in the enumeration degrees.Theodore A. Slaman & W. Hugh Woodin - 1997 - Archive for Mathematical Logic 36 (4-5):255-267.
An inference engine with a natural language interface.Jan van Eijck - unknown
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
2014-01-16

Downloads
9 (#1,253,837)

6 months
5 (#639,314)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Highness, locally noncappability and nonboundings.Frank Stephan & Guohua Wu - 2013 - Annals of Pure and Applied Logic 164 (5):511-522.

Add more citations

References found in this work

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.

View all 9 references / Add more references