Sam Sanders

Orcid: 0000-0001-8256-0009

According to our database1, Sam Sanders authored at least 44 papers between 2008 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
On some computational properties of open sets.
CoRR, 2024

2023
Exploring the abyss in Kleene's computability theory.
CoRR, 2023

The Non-normal Abyss in Kleene's Computability Theory.
Proceedings of the Unity of Logic and Computation, 2023

2022
On the Uncountability of ℝ R.
J. Symb. Log., December, 2022

On the computational properties of basic mathematical notions.
J. Log. Comput., 2022

Lifting proofs from countable to uncountable mathematics.
Inf. Comput., 2022

Countable sets versus sets that are countable in reverse mathematics.
Comput., 2022

On the Computational Properties of the Uncountability of the Real Numbers.
Proceedings of the Logic, Language, Information, and Computation, 2022

Between Turing and Kleene.
Proceedings of the Logical Foundations of Computer Science - International Symposium, 2022

Betwixt Turing and Kleene.
Proceedings of the Logical Foundations of Computer Science - International Symposium, 2022

Reverse Mathematics of the Uncountability of ℝ.
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.
J. Log. Comput., 2021

Nets and reverse mathematics.
Comput., 2021

Splittings and Robustness for the Heine-Borel Theorem.
Proceedings of the Connecting with Computability, 2021

2020
Reverse formalism 16.
Synth., 2020

Splittings and Disjunctions in Reverse Mathematics.
Notre Dame J. Formal Log., 2020

The unreasonable effectiveness of Nonstandard Analysis.
J. Log. Comput., 2020

Open sets in computability theory and reverse mathematics.
J. Log. Comput., 2020

Pincherle's theorem in reverse mathematics and computability theory.
Ann. Pure Appl. Log., 2020

Lifting Recursive Counterexamples to Higher-Order Arithmetic.
Proceedings of the Logical Foundations of Computer Science - International Symposium, 2020

2019
Computability Theory, Nonstandard Analysis, and their Connections.
J. Symb. Log., 2019

On the mathematical and foundational significance of the uncountable.
J. Math. Log., 2019

Nets and Reverse Mathematics, a pilot study.
CoRR, 2019

A note on non-classical nonstandard arithmetic.
Ann. Pure Appl. Log., 2019

The strength of compactness in Computability Theory and Nonstandard Analysis.
Ann. Pure Appl. Log., 2019

Reverse Mathematics and parameter-free Transfer.
Ann. Pure Appl. Log., 2019

Reverse Mathematics and Computability Theory of Domain Theory.
Proceedings of the Logic, Language, Information, and Computation, 2019

Nets and Reverse Mathematics - Some Initial Results.
Proceedings of the Computing with Foresight and Industry, 2019

2018
Refining the Taming of the Reverse Mathematics Zoo.
Notre Dame J. Formal Log., 2018

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

Metastability and Higher-Order Computability.
Proceedings of the Logical Foundations of Computer Science - International Symposium, 2018

Some Nonstandard Equivalences in Reverse Mathematics.
Proceedings of the Sailing Routes in the World of Computation, 2018

2017
Grilliot's trick in Nonstandard Analysis.
Log. Methods Comput. Sci., 2017

From Nonstandard Analysis to Various Flavours of Computability Theory.
Proceedings of the Theory and Applications of Models of Computation, 2017

Solar Radiation Prediction Improvement Using Weather Forecasts.
Proceedings of the 16th IEEE International Conference on Machine Learning and Applications, 2017

2016
The computational content of Nonstandard Analysis.
Proceedings of the Proceedings Sixth International Workshop on Classical Logic and Computation, 2016

A Computable Solution to Partee's Temperature Puzzle.
Proceedings of the Logical Aspects of Computational Linguistics. Celebrating 20 Years of LACL (1996-2016), 2016

2013
Reverse-engineering Reverse Mathematics.
Ann. Pure Appl. Log., 2013

2012
Algorithm and proof as Ω-invariance and transfer: A new model of computation in nonstandard analysis.
Proceedings of the Proceedings 8th International Workshop on Developments in Computational Models, 2012

The Dirac delta function in two settings of Reverse Mathematics.
Arch. Math. Log., 2012

2011
ERNA and Friedman's Reverse Mathematics.
J. Symb. Log., 2011

2010
Relative arithmetic.
Math. Log. Q., 2010

More infinity for a better finitism.
Ann. Pure Appl. Log., 2010

2008
Transfer and a supremum principle for ERNA.
J. Symb. Log., 2008


  Loading...