✦ LIBER ✦

Maximal Pairs of Computably Enumerable Sets in the Computably Lipschitz Degrees

✍ Scribed by Klaus Ambos-Spies, Decheng Ding, Yun Fan, Wolfgang Merkle

Book ID: 118780968
Publisher: Springer
Year: 2012
Tongue: English
Weight: 747 KB
Volume: 52
Category: Article
ISSN: 1433-0490
DOI: 10.1007/s00224-012-9424-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Maximal pairs of c.e. reals in the compu

Maximal pairs of c.e. reals in the computably Lipschitz degrees

✍ Yun Fan; Liang Yu 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 282 KB

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

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

Undecidability and 1-types in intervals

Undecidability and 1-types in intervals of the computably enumerable degrees

✍ Klaus Ambos-Spies; Denis R. Hirschfeldt; Richard A. Shore 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 338 KB

We show that the theory of the partial ordering of the computably enumerable degrees in any given nontrivial interval is undecidable and has uncountably many 1-types.