✦ LIBER ✦

The computably enumerable degrees are locally non-cappable

✍ Scribed by Matthew B. Giorgi

Book ID: 105842079
Publisher: Springer
Year: 2004
Tongue: English
Weight: 211 KB
Volume: 43
Category: Article
ISSN: 0933-5846
DOI: 10.1007/s00153-003-0187-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The degrees of computably enumerable set

The degrees of computably enumerable sets are not dense

✍ George Barmpalias; Andrew E.M. Lewis 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 251 KB

A Cappable Almost Everywhere Dominating

A Cappable Almost Everywhere Dominating Computably Enumerable Degree

✍ George Barmpalias; Antonio Montalbán 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 306 KB

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

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