✦ LIBER ✦

Contiguity and Distributivity in the Enumerable Turing Degrees: Corrigendum

✍ Scribed by Rodney G. Downey and Steffen Lempp

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Upper bounds on ideals in the computably

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

Embedding Finite Lattices into the Ideal

✍ William C. Calhoun and Manuel Lerman 📂 Article 📅 2001 🏛 Association for Symbolic Logic 🌐 English ⚖ 274 KB

Decomposability of low 2-computably enum

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

Decomposition and Infima in the Computab

✍ Rodney G. Downey, Geoffrey L. Laforte and Richard A. Shore 📂 Article 📅 2003 🏛 Association for Symbolic Logic 🌐 English ⚖ 637 KB

Maximal Chains in the Turing Degrees

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

Tracing and domination in the Turing deg

✍ George Barmpalias 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 239 KB