On the Definable Ideal Generated by Nonbounding C.E. Degrees

&
Journal of Symbolic Logic 70 (1):252 - 270 (2005)
  Copy   BIBTEX

Abstract

Let [NB]₁ denote the ideal generated by nonbounding c.e. degrees and NCup the ideal of noncuppable c.e. degrees. We show that both [NB]₁ ∪ NCup and the ideal generated by nonbounding and noncuppable degrees are new, in the sense that they are different from M, [NB]₁ and NCup—the only three known definable ideals so far

Categories

Keywords

Reprint years

DOI

10.2178/jsl/1107298519

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 100,809

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 the plus cupping c.e. degrees.Wei Wang & Decheng Ding - 2007 - Archive for Mathematical Logic 46 (3-4):321-346.
A minimal pair joining to a plus cupping Turing degree.Dengfeng Li & Angsheng Li - 2003 - Mathematical Logic Quarterly 49 (6):553-566.
Upper bounds on ideals in the computably enumerable Turing degrees.George Barmpalias & André Nies - 2011 - Annals of Pure and Applied Logic 162 (6):465-473.
Exact pairs for the ideal of the k-trivial sequences in the Turing degrees.George Barmpalias & Rod G. Downey - 2014 - Journal of Symbolic Logic 79 (3):676-692.
Bounding computably enumerable degrees in the Ershov hierarchy.Angsheng Li, Guohua Wu & Yue Yang - 2006 - Annals of Pure and Applied Logic 141 (1):79-88.
Maximal contiguous degrees.Peter Cholak, Rod Downey & Stephen Walk - 2002 - Journal of Symbolic Logic 67 (1):409-437.
Joining to high degrees via noncuppables.Jiang Liu & Guohua Wu - 2010 - Archive for Mathematical Logic 49 (2):195-211.
A Bounded Jump for the Bounded Turing Degrees.Bernard Anderson & Barbara Csima - 2014 - Notre Dame Journal of Formal Logic 55 (2):245-264.
Non‐isolated quasi‐degrees.Ilnur I. Batyrshin - 2009 - Mathematical Logic Quarterly 55 (6):587-597.
Completely mitotic c.e. degrees and non-jump inversion.Evan J. Griffiths - 2005 - Annals of Pure and Applied Logic 132 (2-3):181-207.

Analytics

Added to PP
2010-08-24

Downloads
66 (#319,039)

6 months
19 (#151,556)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Citations of this work

On definable filters in computably enumerable degrees.Wei Wang & Decheng Ding - 2007 - Annals of Pure and Applied Logic 147 (1):71-83.
On the definable ideal generated by the plus cupping c.e. degrees.Wei Wang & Decheng Ding - 2007 - Archive for Mathematical Logic 46 (3-4):321-346.

Add more citations

References found in this work

Parameter definability in the recursively enumerable degrees.André Nies - 2003 - Journal of Mathematical Logic 3 (01):37-65.

Add more references