|
Registered User
|
|
|
Apr 26 |
comment |
Can nonstandard analysis be used to prove results in constructive or computable analysis? I do not know whether this is what you are looking for but Keita Yokoama used non-standard analysis to analyze the strength of the Riemann mapping theorem in terms of reverse mathematics, see math.tohoku.ac.jp/~y-keita/papers/… |
|
Feb 21 |
accepted | (Un)Decidability of the root existence problem for functions with bounded domain |
|
Feb 17 |
awarded | ● Enthusiast |
|
Feb 1 |
awarded | ● Commentator |
|
Feb 1 |
comment |
Partitions of central sets via dynamical systems Asaf: The sets $S,S′$ are clearly central. But I do not see why this implies that $\{ s_{n′} \mid n′\in S′ \}$ is central. However, this might be what Hillel was thinking about. Maybe there is just an argument missing |
|
Feb 1 |
comment |
Partitions of central sets via dynamical systems @Gabor: your right that should be 0, thank you. It is now corrected. |
|
Feb 1 |
revised |
Partitions of central sets via dynamical systems corrected definition of proximality |
|
Feb 1 |
asked | Partitions of central sets via dynamical systems |
|
Jan 19 |
comment |
(Un)Decidability of the root existence problem for functions with bounded domain @François thank you, I missed that point. |
|
Jan 19 |
revised |
(Un)Decidability of the root existence problem for functions with bounded domain See comment by François: He is right, I added an step which shows that decision algorithm for roots can be used to compute a root. |
|
Jan 19 |
answered | (Un)Decidability of the root existence problem for functions with bounded domain |
|
Jan 14 |
accepted | About the well ordering of finite sequences of numbers |
|
Jan 12 |
awarded | ● Teacher |
|
Jan 12 |
answered | About the well ordering of finite sequences of numbers |
