1 citations · 3 across the 10 of their papers we have counts for
19 papers · 1 filter
Between Turing and Kleene
Sam Sanders
Turing's famous `machine' model constitutes the first intuitively convincing framework for computing with real numbers. Kleene's computation schemes S1-S9 extend Turing's approach…
Betwixt Turing and Kleene
Dag Normann, Sam Sanders
Turing's famous 'machine' model constitutes the first intuitively convincing framework for computing with real numbers. Kleene's computation schemes S1-S9 extend Turing's approach…
Splittings and robustness for the Heine-Borel theorem
Sam Sanders
The Heine-Borel theorem for uncountable coverings has recently emerged as an interesting and central principle in higher-order Reverse Mathematics and computability theory, formula…
Reverse Mathematics of the uncountability of : Baire classes, metric spaces, and unordered sums
Sam Sanders
Dag Normann and the author have recently initiated the study of the logical and computational properties of the uncountability of formalised as the statement $\textsf{…
Countable sets versus sets that are countable in Reverse Mathematics
Sam Sanders
The program Reverse Mathematics (RM for short) seeks to identify the axioms necessary to prove theorems of ordinary mathematics, usually working in the language of second-order ari…
The Axiom of Choice in Computability Theory and Reverse Mathematics, with a cameo for the Continuum Hypothesis
Dag Normann, Sam Sanders
The Axiom of Choice (AC for short) is the most (in)famous axiom of the usual foundations of mathematics, ZFC set theory. The (non-)essential use of AC in mathematics has been well-…