✦ LIBER ✦

The semilattice of computable families of recursively enumerable sets

✍ Scribed by A. N. Degtev

Publisher: SP MAIK Nauka/Interperiodica
Year: 1991
Tongue: English
Weight: 228 KB
Volume: 50
Category: Article
ISSN: 0001-4346
DOI: 10.1007/bf01137732

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On discrete families of recursively enum

On discrete families of recursively enumerable sets

✍ V. V. V'yugin 📂 Article 📅 1972 🏛 Springer US 🌐 English ⚖ 789 KB

Upper semilattice of recursively enumera

Upper semilattice of recursively enumerable sQ-degrees

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

Recursively Enumerable Images of Arithme

Recursively Enumerable Images of Arithmetic Sets

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

Onm- degrees of recursively enumerable s

Onm- degrees of recursively enumerable sets

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

Upper semilattice of recursively enumera

Upper semilattice of recursively enumerable 124-1124-1124-1-degrees

✍ R. Sh. Omanadze 📂 Article 📅 1984 🏛 Springer US 🌐 English ⚖ 400 KB

On a Class of Recursively Enumerable Set

On a Class of Recursively Enumerable Sets

✍ Farzad Didehvar 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 225 KB 👁 1 views

## Abstract We define a class of so‐called ∑(__n__)‐sets as a natural closure of recursively enumerable sets __W__~n~ under the relation “∈” and study its properties.