1 citations · 2 across the 3 of their papers we have counts for
6 papers · 1 filter
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…
Computability and Non-monotone induction
Dag Normann
Non-monotone inductive definitions were studied in the late 1960's and early 1970's with the aim of understanding connections between the complexity of the formulas defining the in…
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-…
Open sets in computability theory and Reverse Mathematics
Dag Normann, Sam Sanders
To enable the study of open sets in computational approaches to mathematics, lots of extra data and structure on these sets is assumed. For both foundational and mathematical reaso…
Measure-theoretic Uniformity and the Suslin Functional
Dag Normann
We generalise results by Sacks and Tanaka concerning measure-theoretic uniformity for hyperarithmetical sets and a basis theorem for -sets of positive measure to computabili…
Pincherle's theorem in Reverse Mathematics and computability theory
Dag Normann, Sam Sanders
We study the logical and computational properties of basic theorems of uncountable mathematics, in particular Pincherle's theorem, published in 1882. This theorem states that a loc…