✦ LIBER ✦

A Hierarchy for the Plus Cupping Turing Degrees

✍ Scribed by Yong Wang and Angsheng Li

Book ID: 124980262
Publisher: Association for Symbolic Logic
Year: 2003
Tongue: English
Weight: 430 KB
Volume: 68
Category: Article
ISSN: 0022-4812
DOI: 10.2307/4147724

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A minimal pair joining to a plus cupping

A minimal pair joining to a plus cupping Turing degree

✍ Dengfeng Li; Angsheng Li 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 195 KB

## Abstract A computably enumerable (c.e.) degree a is called nonbounding, if it bounds no minimal pair, and plus cupping, if every nonzero c.e. degree __x__ below __a__ is cuppable. Let **NB** and **PC** be the sets of all nonbounding and plus cupping c.e. degrees, respectively. Both **NB** and **

Cupping and noncapping in the r.e. weak

Cupping and noncapping in the r.e. weak truth table and turing degrees

✍ Ambos-Spies, Klaus 📂 Article 📅 1985 🏛 Springer-Verlag ⚖ 930 KB

On the definable ideal generated by the

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

✍ Wei Wang; Decheng Ding 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 378 KB

Model-theoretic properties of turing deg

Model-theoretic properties of turing degrees in the Ershov difference hierarchy

✍ M. M. Arslanov 📂 Article 📅 2012 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 582 KB

Decomposability of low 2-computably enum

Decomposability of low 2-computably enumerable degrees and turing jumps in the Ershov hierarchy

✍ M. Kh. Faizrakhmanov 📂 Article 📅 2010 🏛 Allerton Press, Inc. 🌐 English ⚖ 538 KB

Maximal Chains in the Turing Degrees

✍ C. T. Chong and Liang Yu 📂 Article 📅 2007 🏛 Association for Symbolic Logic 🌐 English ⚖ 752 KB