✦ LIBER ✦

Some lattice-invariant properties of classes of recursively enumerable sets

✍ Scribed by A. N. Degtev

Publisher: Springer US
Year: 1988
Tongue: English
Weight: 404 KB
Volume: 27
Category: Article
ISSN: 0002-5232
DOI: 10.1007/bf01982272

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

ENUMERATION OF SOME CLASSES OF RECURSIVE

ENUMERATION OF SOME CLASSES OF RECURSIVELY ENUMERABLE SETS

✍ Kempachiro Ohashi 📂 Article 📅 1964 🏛 John Wiley and Sons 🌐 English ⚖ 318 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

Classes of Recursively Enumerable Sets a

Classes of Recursively Enumerable Sets and Degrees of Unsolvability

✍ Donald A. Martin 📂 Article 📅 1966 🏛 John Wiley and Sons 🌐 English ⚖ 939 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

Embedding relations in the lattice of re

Embedding relations in the lattice of recursively enumerable sets

✍ Alton, Donald A. 📂 Article 📅 1975 🏛 Springer-Verlag ⚖ 256 KB

The Index Set of Injectively Enumerable

The Index Set of Injectively Enumerable Classes of Recursively Enumerable Sets in ∑5-Complete

✍ Stephan Wehner 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 372 KB

## Abstract I introduce an effective enumeration of all effective enumerations of classes of r. e. sets and define with this the index set __IE__ of injectively enumerable classes. It is easy to see that this set is ∑~5~ in the Arithmetical Hierarchy and I describe a proof for the ∑~5~‐hardness of