1 citations · 2 across the 2 of their papers we have counts for
3 papers
math.LO2020★ 1 cited
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…
math.LO2019
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…
cs.LO2015★ 1 cited
The extensional realizability model of continuous functionals and three weakly non-constructive classical theorems
Dag Normann
We investigate wether three statements in analysis, that can be proved classically, are realizable in the realizability model of extensional continuous functionals induced by Kleen…