Located sets and reverse mathematics
From MaRDI portal
Recommendations
Cited in
(24)- The polarized Ramsey's theorem
- Computability on subsets of Euclidean space. I: Closed and compact subsets
- Computability on subsets of metric spaces.
- Some reverse location problems
- Refining the taming of the reverse mathematics zoo
- To be or not to be constructive, that is not the question
- Splittings and robustness for the Heine-Borel theorem
- Representations and the foundations of mathematics
- Pincherle's theorem in reverse mathematics and computability theory
- Fundamental notions of analysis in subsystems of second-order arithmetic
- On effectively closed sets of effective strong measure zero
- Reverse mathematics of separably closed sets
- The reverse mathematics of the Tietze extension theorem
- 2010 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '10
- Open questions in reverse mathematics
- Mass Problems and Randomness
- Unconventional algorithms: complementarity of axiomatics and construction
- Nets and reverse mathematics
- The computational content of nonstandard analysis
- Countable sets versus sets that are countable in reverse mathematics
- Two kinds of fixed point theorems and reverse mathematics
- Forcing with bushy trees
- On some computational properties of open sets
- The biggest five of reverse mathematics
This page was built for publication: Located sets and reverse mathematics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4527932)