35 citations · 187 across the 55 of their papers we have counts for
56 papers
Coding is non-robust
Sam Sanders
For various reasons, higher-order objects are often studied in mathematical logic via second-order `codes' or `representations'. An important example hailing from real analysis and…
Numerical choice, Riemann integration, and Reverse Mathematics
Sam Sanders, Dmytro Taranovsky
Riemann integration remains a well-known part of mathematics for both historical and conceptual reasons. We study basic properties like boundedness of Riemann integrable functions…
Exploring the abyss in Kleene's computability theory
Sam Sanders
Kleene's computability theory based on the S1-S9 computation schemes constitutes a model for computing with objects of any finite type and extends Turing's 'machine model' which fo…
Big in Reverse Mathematics: measure and category
Sam Sanders
The smooth development of large parts of mathematics hinges on the idea that some sets are `small' or `negligible' and can therefore be ignored for a given purpose. The perhaps mos…
The non-normal abyss in Kleene's computability theory
Sam Sanders
Kleene's computability theory based on his S1-S9 computation schemes constitutes a model for computing with objects of any finite type and extends Turing's `machine model' which fo…
Is pluralism in the history of mathematics possible?
Jacques Bair, Alexandre Borovik, Vladimir Kanovei +6
Leibniz scholarship is currently an area of lively debate. We respond to some recent criticisms by Archibald et al.