✦ LIBER ✦

Strong Enumeration Reducibilities

✍ Scribed by Roland Sh. Omanadze; Andrea Sorbi

Publisher: Springer
Year: 2006
Tongue: English
Weight: 515 KB
Volume: 45
Category: Article
ISSN: 0933-5846
DOI: 10.1007/s00153-006-0012-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Strong Reducibilities of Enumerations an

Strong Reducibilities of Enumerations and Partial Enumerated Algebras

✍ A. Orlicki 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 984 KB

Correction to “Strong Reducibilities of

Correction to “Strong Reducibilities of Enumerations and Partial Enumerated Algebras”

✍ Andrzej Orlicki 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 62 KB

Immunity properties and strong positive

Immunity properties and strong positive reducibilities

✍ Irakli O. Chitaia; Roland Sh. Omanadze; Andrea Sorbi 📂 Article 📅 2010 🏛 Springer 🌐 English ⚖ 175 KB

Strong and robustly strong polynomial-ti

Strong and robustly strong polynomial-time reducibilities to sparse sets

✍ Ricard Gavaldà; JoséL. Balcázar 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 944 KB

Strong enumeration properties of recursi

Strong enumeration properties of recursively enumerable classes

✍ J. B. Florence 📂 Article 📅 1969 🏛 John Wiley and Sons 🌐 English ⚖ 654 KB

Embeddings in the Strong Reducibilities

Embeddings in the Strong Reducibilities Between 1 and npm

✍ Phil Watson 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 520 KB

## Abstract We consider the strongest (most restricted) forms of enumeration reducibility, those that occur between 1‐ and npm‐reducibility inclusive. By defining two new reducibilities (which we call n1‐ and ni‐reducibility) which are counterparts to 1‐ and i‐reducibility, respectively, in the sam