✦ LIBER ✦

Hereditary sets and tabular reducibility

✍ Scribed by A. N. Degtev

Publisher: Springer US
Year: 1972
Tongue: English
Weight: 622 KB
Volume: 11
Category: Article
ISSN: 0002-5232
DOI: 10.1007/bf02218609

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Reducibility and Completeness for Sets o

Reducibility and Completeness for Sets of Integers

✍ Richard M. Friedberg; Hartley Rogers jr. 📂 Article 📅 1959 🏛 John Wiley and Sons 🌐 English ⚖ 574 KB

The study of recursively invariant properties of sets of integers was initiated, in large part, in the 1944paper of POST [l]. Various notions of reducibility, redefined below, are introduced in that paper ; and a set is called complete with respect to a given reducibility if (i) it is recursively en

Addendum to “computably enumerable sets

Addendum to “computably enumerable sets and quasi-reducibility”

✍ R. Downey; G. LaForte; A. Nies 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 29 KB

Classes of recursively enumerable sets a

Classes of recursively enumerable sets and Q-reducibility

✍ R. Sh. Omanadze 📂 Article 📅 1989 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 205 KB

On Pseudo-Creative Sets, Splinters, and

On Pseudo-Creative Sets, Splinters, and Bounded-Truth-Table Reducibility

✍ Paul R. Young 📂 Article 📅 1967 🏛 John Wiley and Sons 🌐 English ⚖ 450 KB

Application of precomplete enumerations

Application of precomplete enumerations to tabular-type degrees and index sets

✍ V. L. Selivanov 📂 Article 📅 1989 🏛 Springer US 🌐 English ⚖ 483 KB

P-Selective Sets and Reducing Search to

P-Selective Sets and Reducing Search to Decision vs Self-Reducibility

✍ Edith Hemaspaandra; Ashish V. Naik; Mitsunori Ogihara; Alan L. Selman 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 684 KB

We distinguish self-reducibility of a language L with the question of whether search reduces to decision for L. Results include: (i) If NE{E, then there exists a set L in NP&P such that search reduces to decision for L, search does not nonadaptively reduce to decision for L and L is not self-reducib