The following pages link to Sam Sanders (Q636386):
Displayed 50 items.
- More infinity for a better finitism (Q636387) (← links)
- The Dirac delta function in two settings of reverse mathematics (Q661294) (← links)
- Refining the taming of the reverse mathematics zoo (Q1633897) (← links)
- Reverse mathematics and parameter-free transfer (Q1634526) (← links)
- A footnote to ``The crisis in contemporary mathematics'' (Q1635798) (← links)
- Some nonstandard equivalences in reverse mathematics (Q1670765) (← links)
- To be or not to be constructive, that is not the question (Q1688964) (← links)
- Metastability and higher-order computability (Q1709712) (← links)
- A note on non-classical nonstandard arithmetic (Q1715475) (← links)
- Approaches to analysis with infinitesimals following Robinson, Nelson, and others (Q1750317) (← links)
- Reverse-engineering reverse mathematics (Q1944329) (← 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)
- 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)
- Lifting recursive counterexamples to higher-order arithmetic (Q2177592) (← links)
- Nets and reverse mathematics. Some initial results (Q2179368) (← links)
- Reverse mathematics and computability theory of domain theory (Q2303616) (← links)
- Pincherle's theorem in reverse mathematics and computability theory (Q2304540) (← links)
- The strength of compactness in computability theory and nonstandard analysis (Q2326415) (← links)
- Lifting proofs from countable to uncountable mathematics (Q2672667) (← links)
- A Computable Solution to Partee’s Temperature Puzzle (Q2964003) (← links)
- From Nonstandard Analysis to Various Flavours of Computability Theory (Q2988850) (← links)
- ERNA and Friedman's Reverse Mathematics (Q3011124) (← links)
- Relative arithmetic (Q3066289) (← links)
- Saturation and Σ<sub>2</sub>-transfer for ERNA (Q3399183) (← links)
- Transfer and a supremum principle for ERNA (Q3503762) (← links)
- (Q4596802) (← links)
- The Gandy–Hyland functional and a computational aspect of Nonstandard Analysis (Q4608444) (← links)
- (Q4982685) (← links)
- Algorithm and proof as \Omega-invariance and transfer: A new model of computation in nonstandard analysis (Q4994846) (← links)
- Nets and reverse mathematics (Q4995602) (← links)
- (Q5015363) (← links)
- The Axiom of Choice in computability theory and Reverse Mathematics with a cameo for the Continuum Hypothesis (Q5028319) (← links)
- Countable sets versus sets that are countable in reverse mathematics (Q5037215) (← links)
- ON THE UNCOUNTABILITY OF (Q5052009) (← links)
- The unreasonable effectiveness of Nonstandard Analysis (Q5108034) (← links)
- Open sets in computability theory and reverse mathematics (Q5140330) (← links)
- COMPUTABILITY THEORY, NONSTANDARD ANALYSIS, AND THEIR CONNECTIONS (Q5207560) (← links)
- On the mathematical and foundational significance of the uncountable (Q5223120) (← links)
- On the computational properties of basic mathematical notions (Q5872876) (← links)
- The non-normal abyss in Kleene's computability theory (Q6149028) (← links)
- On the computational properties of the uncountability of the real numbers (Q6160755) (← links)
- Reverse Mathematics and parameter-free Transfer (Q6254927) (← links)
- The taming of the Reverse Mathematics zoo (Q6257029) (← links)
- More than bargained for in Reverse Mathematics (Q6259018) (← links)