Transfer and a supremum principle for ERNA. - Chris Impens; Sam Sanders (J. Symb. Log., 2008)

More infinity for a better finitism. - Sam Sanders (Ann. Pure Appl. Log., 2010)

Relative arithmetic. - Sam Sanders (Math. Log. Q., 2010)

ERNA and Friedman's Reverse Mathematics. - Sam Sanders (J. Symb. Log., 2011)

The Dirac delta function in two settings of Reverse Mathematics. - Sam Sanders; Keita Yokoyama (Arch. Math. Log., 2012)

Algorithm and proof as Ω-invariance and transfer: A new model of computation in nonstandard analysis. - Sam Sanders (DCM, 2012)

Reverse-engineering Reverse Mathematics. - Sam Sanders (Ann. Pure Appl. Log., 2013)

A Computable Solution to Partee's Temperature Puzzle. - Kristina Liefke; Sam Sanders (LACL, 2016)

The computational content of Nonstandard Analysis. - Sam Sanders (CL&C, 2016)

Solar Radiation Prediction Improvement Using Weather Forecasts. - Sam Sanders; Chris Barrick; Frederick W. Maier; Khaled Rasheed (ICMLA, 2017)

From Nonstandard Analysis to Various Flavours of Computability Theory. - Sam Sanders (TAMC, 2017)

Grilliot's trick in Nonstandard Analysis. - Sam Sanders (Log. Methods Comput. Sci., 2017)

Some Nonstandard Equivalences in Reverse Mathematics. - Sam Sanders (CiE, 2018)

Metastability and Higher-Order Computability. - Sam Sanders (LFCS, 2018)

The Gandy-Hyland functional and a computational aspect of Nonstandard Analysis. - Sam Sanders (Comput., 2018)

Refining the Taming of the Reverse Mathematics Zoo. - Sam Sanders (Notre Dame J. Formal Log., 2018)

Nets and Reverse Mathematics - Some Initial Results. - Sam Sanders (CiE, 2019)

Reverse Mathematics and Computability Theory of Domain Theory. - Sam Sanders (WoLLIC, 2019)

Reverse Mathematics and parameter-free Transfer. - Benno van den Berg; Sam Sanders (Ann. Pure Appl. Log., 2019)

The strength of compactness in Computability Theory and Nonstandard Analysis. - Dag Normann; Sam Sanders (Ann. Pure Appl. Log., 2019)

A note on non-classical nonstandard arithmetic. - Sam Sanders (Ann. Pure Appl. Log., 2019)

Nets and Reverse Mathematics, a pilot study. - Sam Sanders (CoRR, 2019)

On the mathematical and foundational significance of the uncountable. - Dag Normann; Sam Sanders (J. Math. Log., 2019)

Computability Theory, Nonstandard Analysis, and their Connections. - Dag Normann; Sam Sanders (J. Symb. Log., 2019)

Lifting Recursive Counterexamples to Higher-Order Arithmetic. - Sam Sanders (LFCS, 2020)

Pincherle's theorem in reverse mathematics and computability theory. - Dag Normann; Sam Sanders (Ann. Pure Appl. Log., 2020)

Open sets in computability theory and reverse mathematics. - Dag Normann; Sam Sanders (J. Log. Comput., 2020)

The unreasonable effectiveness of Nonstandard Analysis. - Sam Sanders (J. Log. Comput., 2020)

Splittings and Disjunctions in Reverse Mathematics. - Sam Sanders (Notre Dame J. Formal Log., 2020)

Reverse formalism 16. - Sam Sanders (Synth., 2020)

Splittings and Robustness for the Heine-Borel Theorem. - Sam Sanders (CiE, 2021)

Nets and reverse mathematics. - Sam Sanders (Comput., 2021)

The Axiom of Choice in computability theory and Reverse Mathematics with a cameo for the Continuum Hypothesis. - Dag Normann; Sam Sanders (J. Log. Comput., 2021)

Reverse Mathematics of the Uncountability of ℝ. - Sam Sanders (CiE, 2022)

Betwixt Turing and Kleene. - Dag Normann; Sam Sanders (LFCS, 2022)

Between Turing and Kleene. - Sam Sanders (LFCS, 2022)

On the Computational Properties of the Uncountability of the Real Numbers. - Sam Sanders (WoLLIC, 2022)

Countable sets versus sets that are countable in reverse mathematics. - Sam Sanders (Comput., 2022)

Lifting proofs from countable to uncountable mathematics. - Sam Sanders (Inf. Comput., 2022)

On the computational properties of basic mathematical notions. - Dag Normann; Sam Sanders (J. Log. Comput., 2022)

On the Uncountability of ℝ R. - Dag Normann; Sam Sanders (J. Symb. Log., 2022)

The Non-normal Abyss in Kleene's Computability Theory. - Sam Sanders (CiE, 2023)

On the Computational Properties of Weak Continuity Notions. - Sam Sanders (CiE, 2024)

A note on continuous Functions on Metric Spaces. - Sam Sanders (Bull. Symb. Log., 2024)

Exploring the abyss in Kleene's computability theory. - Sam Sanders (Comput., 2024)

On robust theorems due to Bolzano, Weierstrass, Jordan, and Cantor. - Dag Normann; Sam Sanders (J. Symb. Log., 2024)

On the logical and computational properties of the Vitali covering theorem. - Dag Normann; Sam Sanders (Ann. Pure Appl. Log., 2025)

The Biggest Five of Reverse Mathematics. - Dag Normann; Sam Sanders (J. Math. Log., 2025)

On some computational properties of open sets. - Dag Normann; Sam Sanders (J. Log. Comput., 2025)