Timeline for Numerical choice and reverse mathematics
Current License: CC BY-SA 4.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 10 at 10:01 | comment | added | Sam Sanders | That is quite interesting: the upper bound version of numerical choice is equivalent (over Kohlenbach's RCA$_0^\omega$+$(\exists^2)$) to the statement that for a locally bounded function $f:\mathbb{R}\rightarrow\mathbb{R}$, there is continuous $g$ dominating it everywhere. If we assume some countable choice (QF-AC$^{0,1}$ namely), then the equivalence holds for sub-continuous functions. | |
| Oct 10 at 9:56 | vote | accept | Sam Sanders | ||
| Oct 10 at 3:36 | history | answered | Dmytro Taranovsky | CC BY-SA 4.0 |