✦ LIBER ✦

Strong noncuppability in low computably enumerable degrees

✍ Scribed by M. M. Yamaleev

Book ID: 111503454
Publisher: Allerton Press, Inc.
Year: 2010
Tongue: English
Weight: 549 KB
Volume: 54
Category: Article
ISSN: 1066-369X
DOI: 10.3103/s1066369x10040092

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

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

Decomposition and Infima in the Computab

Decomposition and Infima in the Computably Enumerable Degrees

✍ Rodney G. Downey, Geoffrey L. Laforte and Richard A. Shore 📂 Article 📅 2003 🏛 Association for Symbolic Logic 🌐 English ⚖ 637 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

Interpreting N in the computably enumera

Interpreting N in the computably enumerable weak truth table degrees

✍ André Nies 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 129 KB

We give a ÿrst-order coding without parameters of a copy of (N; +; ×) in the computably enumerable weak truth table degrees. As a tool, we develop a theory of parameter deÿnable subsets.

Upper bounds on ideals in the computably

Upper bounds on ideals in the computably enumerable Turing degrees

✍ George Barmpalias; André Nies 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 267 KB