Sam Sanders

According to our database, Sam Sanders authored at least 47 papers between 2008 and 2025.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2025

On the logical and computational properties of the Vitali covering theorem.

Dag Normann, Sam Sanders

Ann. Pure Appl. Log., 2025

2024

On robust theorems due to Bolzano, Weierstrass, Jordan, and Cantor.

Dag Normann, Sam Sanders

J. Symb. Log., 2024

On some computational properties of open sets.

Dag Normann, Sam Sanders

CoRR, 2024

Exploring the abyss in Kleene's computability theory.

Sam Sanders

Comput., 2024

On the Computational Properties of Weak Continuity Notions.

Sam Sanders

Proceedings of the Twenty Years of Theoretical and Practical Synergies, 2024

2023

The Non-normal Abyss in Kleene's Computability Theory.

Sam Sanders

Proceedings of the Unity of Logic and Computation, 2023

2022

On the Uncountability of ℝ R.

Dag Normann, Sam Sanders

J. Symb. Log., December, 2022

On the computational properties of basic mathematical notions.

Dag Normann, Sam Sanders

J. Log. Comput., 2022

Lifting proofs from countable to uncountable mathematics.

Sam Sanders

Inf. Comput., 2022

Countable sets versus sets that are countable in reverse mathematics.

Sam Sanders

Comput., 2022

On the Computational Properties of the Uncountability of the Real Numbers.

Sam Sanders

Proceedings of the Logic, Language, Information, and Computation, 2022

Between Turing and Kleene.

Sam Sanders

Proceedings of the Logical Foundations of Computer Science - International Symposium, 2022

Betwixt Turing and Kleene.

Dag Normann, Sam Sanders

Proceedings of the Logical Foundations of Computer Science - International Symposium, 2022

Reverse Mathematics of the Uncountability of ℝ.

Sam Sanders

Proceedings of the Revolutions and Revelations in Computability, 2022

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

Nets and reverse mathematics.

Sam Sanders

Comput., 2021

Splittings and Robustness for the Heine-Borel Theorem.

Sam Sanders

Proceedings of the Connecting with Computability, 2021

2020

Reverse formalism 16.

Sam Sanders

Synth., 2020

Splittings and Disjunctions in Reverse Mathematics.

Sam Sanders

Notre Dame J. Formal Log., 2020

The unreasonable effectiveness of Nonstandard Analysis.

Sam Sanders

J. Log. Comput., 2020

Open sets in computability theory and reverse mathematics.

Dag Normann, Sam Sanders

J. Log. Comput., 2020

Pincherle's theorem in reverse mathematics and computability theory.

Dag Normann, Sam Sanders

Ann. Pure Appl. Log., 2020

Lifting Recursive Counterexamples to Higher-Order Arithmetic.

Sam Sanders

Proceedings of the Logical Foundations of Computer Science - International Symposium, 2020

2019

Computability Theory, Nonstandard Analysis, and their Connections.

Dag Normann, Sam Sanders

J. Symb. Log., 2019

On the mathematical and foundational significance of the uncountable.

Dag Normann, Sam Sanders

J. Math. Log., 2019

Nets and Reverse Mathematics, a pilot study.

Sam Sanders

CoRR, 2019

A note on non-classical nonstandard arithmetic.

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

Reverse Mathematics and parameter-free Transfer.

Benno van den Berg, Sam Sanders

Ann. Pure Appl. Log., 2019

Reverse Mathematics and Computability Theory of Domain Theory.

Sam Sanders

Proceedings of the Logic, Language, Information, and Computation, 2019

Nets and Reverse Mathematics - Some Initial Results.

Sam Sanders

Proceedings of the Computing with Foresight and Industry, 2019

2018

Refining the Taming of the Reverse Mathematics Zoo.

Sam Sanders

Notre Dame J. Formal Log., 2018

The Gandy-Hyland functional and a computational aspect of Nonstandard Analysis.

Sam Sanders

Comput., 2018

Metastability and Higher-Order Computability.

Sam Sanders

Proceedings of the Logical Foundations of Computer Science - International Symposium, 2018

Some Nonstandard Equivalences in Reverse Mathematics.

Sam Sanders

Proceedings of the Sailing Routes in the World of Computation, 2018

2017

Grilliot's trick in Nonstandard Analysis.

Sam Sanders

Log. Methods Comput. Sci., 2017

From Nonstandard Analysis to Various Flavours of Computability Theory.

Sam Sanders

Proceedings of the Theory and Applications of Models of Computation, 2017

Solar Radiation Prediction Improvement Using Weather Forecasts.

Sam Sanders, Chris Barrick, Frederick W. Maier, Khaled Rasheed

Proceedings of the 16th IEEE International Conference on Machine Learning and Applications, 2017

2016

The computational content of Nonstandard Analysis.

Sam Sanders

Proceedings of the Proceedings Sixth International Workshop on Classical Logic and Computation, 2016

A Computable Solution to Partee's Temperature Puzzle.

Kristina Liefke, Sam Sanders

Proceedings of the Logical Aspects of Computational Linguistics. Celebrating 20 Years of LACL (1996-2016), 2016

2013

Reverse-engineering Reverse Mathematics.

Sam Sanders

Ann. Pure Appl. Log., 2013

2012

Algorithm and proof as Ω-invariance and transfer: A new model of computation in nonstandard analysis.

Sam Sanders

Proceedings of the Proceedings 8th International Workshop on Developments in Computational Models, 2012

The Dirac delta function in two settings of Reverse Mathematics.

Sam Sanders, Keita Yokoyama

Arch. Math. Log., 2012

2011

ERNA and Friedman's Reverse Mathematics.

Sam Sanders

J. Symb. Log., 2011

2010

Relative arithmetic.

Sam Sanders

Math. Log. Q., 2010

More infinity for a better finitism.

Sam Sanders

Ann. Pure Appl. Log., 2010

2008

Transfer and a supremum principle for ERNA.

Chris Impens, Sam Sanders

J. Symb. Log., 2008