✦ LIBER ✦

Minimal Pairs and High Recursively Enumerable Degrees

✍ Scribed by S. B. Cooper

Book ID: 124190189
Publisher: Association for Symbolic Logic
Year: 1974
Tongue: English
Weight: 250 KB
Volume: 39
Category: Article
ISSN: 0022-4812
DOI: 10.2307/2272849

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Minimal Degrees and Recursively Insepara

Minimal Degrees and Recursively Inseparable Pairs of Recursively Enumerable Sets

✍ Manuel Lerman 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 775 KB

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

Minimal pairs in initial segments of the

Minimal pairs in initial segments of the recursively enumerable degrees

✍ R. Downey; M. Stob 📂 Article 📅 1997 🏛 The Hebrew University Magnes Press 🌐 English ⚖ 948 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.

A Minimal Pair of Recursively Enumerable

A Minimal Pair of Recursively Enumerable Degrees

✍ C. E. M. Yates 📂 Article 📅 1966 🏛 Association for Symbolic Logic 🌐 English ⚖ 862 KB

Lower Bounds for Pairs of Recursively En

Lower Bounds for Pairs of Recursively Enumerable Degrees

✍ Lachlan, A. H. 📂 Article 📅 1966 🏛 Oxford University Press 🌐 English ⚖ 719 KB