✦ LIBER ✦

A Minimal Pair of Recursively Enumerable Degrees

✍ Scribed by C. E. M. Yates

Book ID: 124963176
Publisher: Association for Symbolic Logic
Year: 1966
Tongue: English
Weight: 862 KB
Volume: 31
Category: Article
ISSN: 0022-4812
DOI: 10.2307/2269807

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.

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

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

The existence of recursively enumerable

The existence of recursively enumerable minimal truth-tabular degrees

✍ S. S. Marchenkov 📂 Article 📅 1975 🏛 Springer US 🌐 English ⚖ 430 KB

Minimal Upper Bounds for Sequences of Re

Minimal Upper Bounds for Sequences of Recursively Enumerable Degrees

✍ Cooper, S. B. 📂 Article 📅 1972 🏛 Oxford University Press 🌐 English ⚖ 141 KB