✦ LIBER ✦

Decomposition and Infima in the Computably Enumerable Degrees

✍ Scribed by Rodney G. Downey, Geoffrey L. Laforte and Richard A. Shore

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

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Maximal Pairs of Computably Enumerable S

Maximal Pairs of Computably Enumerable Sets in the Computably Lipschitz Degrees

✍ Klaus Ambos-Spies, Decheng Ding, Yun Fan, Wolfgang Merkle 📂 Article 📅 2012 🏛 Springer 🌐 English ⚖ 747 KB

Strong noncuppability in low computably

Strong noncuppability in low computably enumerable degrees

✍ M. M. Yamaleev 📂 Article 📅 2010 🏛 Allerton Press, Inc. 🌐 English ⚖ 549 KB

Bounding computably enumerable degrees i

Bounding computably enumerable degrees in the Ershov hierarchy

✍ Angsheng Li; Guohua Wu; Yue Yang 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 219 KB

An Interval of Computably Enumerable Iso

An Interval of Computably Enumerable Isolating Degrees

✍ Matthew C. Salts 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 850 KB

## Abstract We construct computably enumerable degrees __a < b__ such that all computably enumerable degrees c with __a < c < b__ isolate some d. c. e. degree __d.__

The computably enumerable degrees are lo

The computably enumerable degrees are locally non-cappable

✍ Matthew B. Giorgi 📂 Article 📅 2004 🏛 Springer 🌐 English ⚖ 211 KB

Splitting in 2-computably enumerable deg

Splitting in 2-computably enumerable degrees with avoiding cones

✍ M. M. Yamaleev 📂 Article 📅 2009 🏛 Allerton Press, Inc. 🌐 English ⚖ 494 KB