On the definable ideal generated by the plus cupping c.e. degrees

&
Archive for Mathematical Logic 46 (3-4):321-346 (2007)
  Copy   BIBTEX

Abstract

In this paper, we will prove that the plus cupping degrees generate a definable ideal on c.e. degrees different from other ones known so far, thus answering a question asked by Li and Yang (Proceedings of the 7th and the 8th Asian Logic Conferences. World Scientific Press, Singapore, 2003)

Categories

Keywords

Reprint years

DOI

10.1007/s00153-007-0046-2

Links

PhilArchive



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

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

A hierarchy for the plus cupping Turing degrees.Yong Wang & Angsheng Li - 2003 - Journal of Symbolic Logic 68 (3):972-988.
On the Definable Ideal Generated by Nonbounding C.E. Degrees.Liang Yu & Yue Yang - 2005 - Journal of Symbolic Logic 70 (1):252 - 270.
The cupping theorem in r/m.Sui Yuefei & Zhang Zaiyue - 1999 - Journal of Symbolic Logic 64 (2):643-650.
Maximal contiguous degrees.Peter Cholak, Rod Downey & Stephen Walk - 2002 - Journal of Symbolic Logic 67 (1):409-437.
The limitations of cupping in the local structure of the enumeration degrees.Mariya I. Soskova - 2010 - Archive for Mathematical Logic 49 (2):169-193.
An almost-universal cupping degree.Jiang Liu & Guohua Wu - 2011 - Journal of Symbolic Logic 76 (4):1137-1152.
On definable filters in computably enumerable degrees.Wei Wang & Decheng Ding - 2007 - Annals of Pure and Applied Logic 147 (1):71-83.
Cupping and definability in the local structure of the enumeration degrees.Hristo Ganchev & Mariya I. Soskova - 2012 - Journal of Symbolic Logic 77 (1):133-158.
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.
The distribution of the generic recursively enumerable degrees.Ding Decheng - 1992 - Archive for Mathematical Logic 32 (2):113-135.
Bounding minimal degrees by computably enumerable degrees.Angsheng Li & Dongping Yang - 1998 - Journal of Symbolic Logic 63 (4):1319-1347.
On a problem of Cooper and Epstein.Shamil Ishmukhametov - 2003 - Journal of Symbolic Logic 68 (1):52-64.
Non‐isolated quasi‐degrees.Ilnur I. Batyrshin - 2009 - Mathematical Logic Quarterly 55 (6):587-597.
Joining to high degrees via noncuppables.Jiang Liu & Guohua Wu - 2010 - Archive for Mathematical Logic 49 (2):195-211.
Benign cost functions and lowness properties.Noam Greenberg & André Nies - 2011 - Journal of Symbolic Logic 76 (1):289 - 312.

Analytics

Added to PP
2013-11-23

Downloads
57 (#276,529)

6 months
6 (#510,232)

Historical graph of downloads
How can I increase my downloads?

Author Profiles

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.

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.
On the Definable Ideal Generated by Nonbounding C.E. Degrees.Liang Yu & Yue Yang - 2005 - Journal of Symbolic Logic 70 (1):252 - 270.
A minimal pair joining to a plus cupping Turing degree.Dengfeng Li & Angsheng Li - 2003 - Mathematical Logic Quarterly 49 (6):553-566.
On the definable ideal generated by nonbounding c.e. degrees.Yue Yang & Liang Yu - 2005 - Journal of Symbolic Logic 70 (1):252-270.

Add more references