The following pages link to (Q5711891):
Displaying 50 items.
- Program extraction for 2-random reals (Q365682) (← links)
- Primitive recursion and the chain antichain principle (Q435242) (← links)
- A computable version of Banach's inverse mapping theorem (Q1006604) (← links)
- Dirk Jan Struik and his contributions to the history of mathematics (Q1337052) (← links)
- Refining the taming of the reverse mathematics zoo (Q1633897) (← links)
- Reverse mathematics and parameter-free transfer (Q1634526) (← links)
- Arithmetical conservation results (Q1688961) (← links)
- To be or not to be constructive, that is not the question (Q1688964) (← links)
- A note on non-classical nonstandard arithmetic (Q1715475) (← links)
- Mathematical logic: proof theory, constructive mathematics. Abstracts from the workshop held November 5--11, 2017 (Q1731963) (← links)
- On the indecomposability of \(\omega^n\) (Q1762361) (← links)
- On Brouwer's continuity principle (Q1788331) (← links)
- Proof mining in \(L_{1}\)-approximation (Q1874241) (← links)
- A variant of Mathias forcing that preserves \(\mathsf{ACA}_0\) (Q1938403) (← links)
- Reverse mathematics of topology: dimension, paracompactness, and splittings (Q1981984) (← links)
- Reverse formalism 16 (Q2054114) (← links)
- Reverse mathematics of the uncountability of \(\mathbb{R}\) (Q2104277) (← links)
- Parallelizations in Weihrauch reducibility and constructive reverse mathematics (Q2106590) (← links)
- Splittings and robustness for the Heine-Borel theorem (Q2117802) (← links)
- Representations and the foundations of mathematics (Q2134273) (← links)
- Betwixt Turing and Kleene (Q2151412) (← links)
- Between Turing and Kleene (Q2151416) (← links)
- Splittings and disjunctions in reverse mathematics (Q2176407) (← links)
- Using Ramsey's theorem once (Q2274133) (← links)
- Pincherle's theorem in reverse mathematics and computability theory (Q2304540) (← links)
- Dependent choice as a termination principle (Q2309508) (← links)
- The strength of compactness in computability theory and nonstandard analysis (Q2326415) (← links)
- Fundamental notions of analysis in subsystems of second-order arithmetic (Q2368910) (← links)
- Determinacy in third order arithmetic (Q2404651) (← links)
- Equivalence of bar induction and bar recursion for continuous functions with continuous moduli (Q2417961) (← links)
- Classical consequences of continuous choice principles from intuitionistic analysis (Q2443117) (← links)
- Lifting proofs from countable to uncountable mathematics (Q2672667) (← links)
- Term extraction and Ramsey's theorem for pairs (Q2915896) (← links)
- THE DEFINABILITY STRENGTH OF COMBINATORIAL PRINCIPLES (Q2976345) (← links)
- From Nonstandard Analysis to Various Flavours of Computability Theory (Q2988850) (← links)
- ERNA and Friedman's Reverse Mathematics (Q3011124) (← links)
- Effective Choice and Boundedness Principles in Computable Analysis (Q3083466) (← links)
- Reverse Mathematics: The Playground of Logic (Q3163663) (← links)
- Open Questions in Reverse Mathematics (Q3174640) (← links)
- Intuitionistic Provability versus Uniform Provability in $$\mathsf{RCA}$$ (Q3195695) (← links)
- Partition Theorems and Computability Theory (Q3370615) (← links)
- Non-branching degrees in the Medvedev lattice of Π<sub>1</sub><sup>0</sup> classes (Q3426564) (← links)
- Measure theory and higher order arithmetic (Q3450084) (← links)
- TRANSFINITE RECURSION IN HIGHER REVERSE MATHEMATICS (Q3450810) (← links)
- ON WEIHRAUCH REDUCIBILITY AND INTUITIONISTIC REVERSE MATHEMATICS (Q4600462) (← links)
- Weihrauch and constructive reducibility between existence statements (Q4995601) (← links)
- Nets and reverse mathematics (Q4995602) (← links)
- (Q5015363) (← links)
- Reverse mathematics and Weihrauch analysis motivated by finite complexity theory (Q5037213) (← links)
- Countable sets versus sets that are countable in reverse mathematics (Q5037215) (← links)
