✦ LIBER ✦

A class of hypersimple incomplete sets

✍ Scribed by M. M. Arslanov

Publisher: SP MAIK Nauka/Interperiodica
Year: 1985
Tongue: English
Weight: 144 KB
Volume: 38
Category: Article
ISSN: 0001-4346
DOI: 10.1007/bf01157017

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Hypersimple sets with retraceable comple

Hypersimple sets with retraceable complements

✍ A. N. Degtev 📂 Article 📅 1971 🏛 Springer US 🌐 English ⚖ 521 KB

Classes bounded by incomplete sets

✍ Kejia Ho; Frank Stephan 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 184 KB

We study connections between strong reducibilities and properties of computably enumerable sets such as simplicity. We say that a class S of computably enumerable sets bounded i there is an m-incomplete computably enumerable set A such that every set in S is m-reducible to A. For example, we show th

A class of resolvable incomplete block d

A class of resolvable incomplete block designs

✍ D.V.S. Sastry 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 400 KB

On a class of games with incomplete conn

On a class of games with incomplete connections

✍ S.A. Orlovskii 📂 Article 📅 1972 🏛 Elsevier Science ⚖ 593 KB

A class of recursively enumberable sets

✍ A. S. Morozov 📂 Article 📅 1987 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 414 KB

Effective bounds for convergence, descri

Effective bounds for convergence, descriptive complexity, and natural examples of simple and hypersimple sets

✍ Andrej Muchnik; Alexei Semenov 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 154 KB