✦ LIBER ✦

The limitations of cupping in the local structure of the enumeration degrees

✍ Scribed by Mariya I. Soskova

Publisher: Springer
Year: 2009
Tongue: English
Weight: 306 KB
Volume: 49
Category: Article
ISSN: 0933-5846
DOI: 10.1007/s00153-009-0171-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Limit lemmas and jump inversion in the e

Limit lemmas and jump inversion in the enumeration degrees

✍ Evan J. Griffiths 📂 Article 📅 2003 🏛 Springer 🌐 English ⚖ 155 KB

Sublattices of the Recursively Enumerabl

Sublattices of the Recursively Enumerable Degrees

✍ S. K. Thomason 📂 Article 📅 1971 🏛 John Wiley and Sons 🌐 English ⚖ 471 KB

Sets of generators and automorphism base

Sets of generators and automorphism bases for the enumeration degrees

✍ Andrea Sorbi 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 568 KB

We exhibit some automorphism bases for the enumeration degrees, and we derive some consequences relative to the automorphisms of the enumeration degrees.

The existence of recursively enumerable

The existence of recursively enumerable minimal truth-tabular degrees

✍ S. S. Marchenkov 📂 Article 📅 1975 🏛 Springer US 🌐 English ⚖ 430 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.

On the structure of subrecursive degrees

✍ Sanat K. Basu 📂 Article 📅 1970 🏛 Elsevier Science 🌐 English ⚖ 549 KB

Subrecursive degrees are partitions of computable (recursive) functions generated by strong reducibility orderings. Such reducibilities can be naturally characterized in terms of closure operations. Closure operations corresponding to standard reducibilities such as "primitive recursive," etc., are