✦ LIBER ✦

Effectively closed sets and enumerations

✍ Scribed by Paul Brodhead; Douglas Cenzer

Publisher: Springer
Year: 2008
Tongue: English
Weight: 257 KB
Volume: 46
Category: Article
ISSN: 0933-5846
DOI: 10.1007/s00153-008-0065-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Effectively closed sets of measures and

Effectively closed sets of measures and randomness

✍ Jan Reimann 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 692 KB

Effectively hyperimmune sets and majoran

Effectively hyperimmune sets and majorants

✍ M. M. Arslanov 📂 Article 📅 1985 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 343 KB

Computability by means of effectively de

Computability by means of effectively definable schemes and definability via enumerations

✍ Ivan N. Soskov 📂 Article 📅 1990 🏛 Springer 🌐 English ⚖ 689 KB

Effectively and Noneffectively Nowhere S

Effectively and Noneffectively Nowhere Simple Sets

✍ Valentina S. Harizanov 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 445 KB

R. Shore proved that every recursively enumerable (r. e.) set can be split into two (disjoint) nowhere simple sets. Splitting theorems play an important role in recursion theory since they provide information about the lattice E of all r. e. sets. Nowhere simple sets were further studied by D. Mille

Derivatives and closed sets

✍ J. MaŘík 📂 Article 📅 1984 🏛 Akadmiai Kiad 🌐 English ⚖ 255 KB

Isomorphism theorem for BSS recursively

Isomorphism theorem for BSS recursively enumerable sets over real closed fields

✍ C. Michaux; C. Troestler 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 179 KB

The main result of this paper lies in the framework of BSS computability: it shows roughly that any recursively enumerable set S in R N , N 6∞, where R is a real closed ÿeld, is isomorphic to R dimS by a bijection ' which is decidable over S. Moreover the map S → ' is computable. Some related matter