✦ LIBER ✦

Minimal Degrees and Recursively Inseparable Pairs of Recursively Enumerable Sets

✍ Scribed by Manuel Lerman

Publisher: John Wiley and Sons
Year: 1991
Tongue: English
Weight: 775 KB
Volume: 37
Category: Article
ISSN: 0044-3050
DOI: 10.1002/malq.19910371907

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Some More Minimal Pairs of α-Recursively

Some More Minimal Pairs of α-Recursively Enumerable Degrees

✍ Richard A. Shore 📂 Article 📅 1978 🏛 John Wiley and Sons 🌐 English ⚖ 768 KB

Strong Minimal Covers for Recursively En

Strong Minimal Covers for Recursively Enumerable Degrees

✍ S. Barry Cooper 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 386 KB

## Abstract We prove that there exists a nonzero recursively enumerable Turing degree possessing a strong minimal cover. Mathematics Subject Classification: 03D30.

Classes of Recursively Enumerable Sets a

Classes of Recursively Enumerable Sets and Degrees of Unsolvability

✍ Donald A. Martin 📂 Article 📅 1966 🏛 John Wiley and Sons 🌐 English ⚖ 939 KB

Sublattices of the Recursively Enumerabl

Sublattices of the Recursively Enumerable Degrees

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

Recursively Enumerable Images of Arithme

Recursively Enumerable Images of Arithmetic Sets

✍ Richard Rosenberg 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 656 KB

Some Properties of Recursively Inseparab

Some Properties of Recursively Inseparable Sets

✍ J. P. Cleave 📂 Article 📅 1970 🏛 John Wiley and Sons 🌐 English ⚖ 658 KB