✦ LIBER ✦

Minimal Upper Bounds for Sequences of Recursively Enumerable Degrees

✍ Scribed by Cooper, S. B.

Book ID: 120097592
Publisher: Oxford University Press
Year: 1972
Tongue: English
Weight: 141 KB
Volume: s2-5
Category: Article
ISSN: 0024-6107
DOI: 10.1112/jlms/s2-5.3.445

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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.

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

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

Minimal Pairs and High Recursively Enume

Minimal Pairs and High Recursively Enumerable Degrees

✍ S. B. Cooper 📂 Article 📅 1974 🏛 Association for Symbolic Logic 🌐 English ⚖ 250 KB

Upper semilattice of recursively enumera

Upper semilattice of recursively enumerable sQ-degrees

✍ R. Sh. Omanadze 📂 Article 📅 1991 🏛 Springer US 🌐 English ⚖ 518 KB

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