✦ LIBER ✦
Isomorphism theorem for BSS recursively enumerable sets over real closed fields
✍ Scribed by C. Michaux; C. Troestler
- Publisher
- Elsevier Science
- Year
- 2000
- Tongue
- English
- Weight
- 179 KB
- Volume
- 231
- Category
- Article
- ISSN
- 0304-3975
No coin nor oath required. For personal study only.
✦ Synopsis
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 matters are also considered like characterization of the real closed ÿelds with a r.e. set of inÿnitesimals, and the dimension of r.e. sets.