𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Friedberg Numberings of Families ofn-Computably Enumerable Sets

✍ Scribed by S.S. Goncharov; S. Lempp; D.R. Solomon

Book ID
110336130
Publisher
Springer US
Year
2002
Tongue
English
Weight
229 KB
Volume
41
Category
Article
ISSN
0002-5232

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Orbits of computably enumerable sets: lo
Orbits of computably enumerable sets: low sets can avoid an upper cone
✍ Russell Miller πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 222 KB

We investigate the orbit of a low computably enumerable (c.e.) set under automorphisms of the partial order E of c.e. sets under inclusion. Given an arbitrary low c.e. set A and an arbitrary noncomputable c.e. set C, we use the New Extension Theorem of Soare to construct an automorphism of E mapping

Effective Enumerations of Families of Fi
Effective Enumerations of Families of Finite Sets of Natural Numbers
✍ Angel V. Ditchev πŸ“‚ Article πŸ“… 1991 πŸ› John Wiley and Sons 🌐 English βš– 301 KB

We construct a universal r.e. set in the following manner: For any (n, x) we construct a set Un,, E 8 such that the set of all (z, n, x ) such that z E U,,,, is r.e. We construct the set Un,x by steps, and on step s we build a finite approximation U,,.x,s of U,,,,, and finally we take Let us describ