✦ LIBER ✦

Every incomplete computably enumerable truth-table degree is branching

✍ Scribed by Peter A. Fejer; Richard A. Shore

Book ID: 105842474
Publisher: Springer
Year: 2001
Tongue: English
Weight: 98 KB
Volume: 40
Category: Article
ISSN: 0933-5846
DOI: 10.1007/s001530000050

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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.