Abstract
Abstract
We study the relative computational power of structures related to the ordered field of reals, specifically using the notion of generic Muchnik reducibility. We show that any expansion of the reals by a continuous function has no more computing power than the reals, answering a question of Igusa, Knight, and Schweber [7]. On the other hand, we show that there is a certain Borel expansion of the reals that is strictly more powerful than the reals and such that any Borel quotient of the reals reduces to it.
Publisher
Cambridge University Press (CUP)
Reference23 articles.
1. [6] Igusa, G. and Knight, J. F. , Comparing two versions of the reals, this Journal, vol. 81 (2016), no. 3, pp. 1115–1123.
2. On zeros of Martin-Löf random Brownian motion;Allen;Journal of Logic and Analysis,2014
3. From Automatic Structures to Borel Structures
4. ${\varPi}_1^0$
classes and degrees of theories;Jockusch;Transactions of the American Mathematical Society,1972
5. Degrees of recursively saturated models
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献