✦ LIBER ✦

tt-Degrees of recursively enumerable turing degrees. II

✍ Scribed by G. N. Kobzev

Publisher: Springer US
Year: 1979
Tongue: English
Weight: 597 KB
Volume: 18
Category: Article
ISSN: 0002-5232
DOI: 10.1007/bf01673943

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Recursively enumerable bw-degrees

✍ G. N. Kobzev 📂 Article 📅 1977 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 409 KB

Sublattices of the Recursively Enumerabl

Sublattices of the Recursively Enumerable Degrees

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

Onm- degrees of recursively enumerable s

Onm- degrees of recursively enumerable sets

✍ S. D. Denisov 📂 Article 📅 1970 🏛 Springer US 🌐 English ⚖ 279 KB

Truth tabular degrees of recursively enu

Truth tabular degrees of recursively enumerable sets

✍ S. Kallibekov 📂 Article 📅 1973 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 282 KB

Upper semilattice of recursively enumera

Upper semilattice of recursively enumerable sQ-degrees

✍ R. Sh. Omanadze 📂 Article 📅 1991 🏛 Springer US 🌐 English ⚖ 518 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.