𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Differences of Computably Enumerable Sets

✍ Scribed by Steffen Lempp; André Nies

Publisher
John Wiley and Sons
Year
2000
Tongue
English
Weight
135 KB
Volume
46
Category
Article
ISSN
0044-3050

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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.

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

Coding in the Partial Order of Enumerabl
Coding in the Partial Order of Enumerable Sets
✍ Leo Harrington; André Nies 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 489 KB

We develop methods for coding with first-order formulas into the partial order E of enumerable sets under inclusion. First we use them to reprove and generalize the (unpublished) result of the first author that the elementary theory of E has the same computational complexity as the theory of the nat