✦ LIBER ✦

On sQ-completeness of recursively enumerable sets

✍ Scribed by R. Sh. Omanadze

Publisher: SP MAIK Nauka/Interperiodica
Year: 1992
Tongue: English
Weight: 232 KB
Volume: 52
Category: Article
ISSN: 0001-4346
DOI: 10.1007/bf01209615

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Upper semilattice of recursively enumera

Upper semilattice of recursively enumerable sQ-degrees

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

∑5-completeness of index sets arising fr

∑5-completeness of index sets arising from the lattice of recursively enumerable sets

✍ Michael A. Jahn 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 795 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.

Recursively Enumerable Images of Arithme

Recursively Enumerable Images of Arithmetic Sets

✍ Richard Rosenberg 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 656 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

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