Dag Normann

Publication Activity (10 Years)

Years Active: 1976-2024
Publications (10 Years): 19

Top Topics

Computational Properties

Reasoning Problems

Computer Algebra

Theoretical Framework

Top Venues

J. Log. Comput.

Ann. Pure Appl. Log.

Publications

Dag Normann, Sam Sanders
On some computational properties of open sets. CoRR (2024)
Dag Normann, Sam Sanders
On the Uncountability of ℝ R. J. Symb. Log. 87 (4) (2022)
Dag Normann, Sam Sanders
On the computational properties of basic mathematical notions. J. Log. Comput. 32 (8) (2022)
Dag Normann, Sam Sanders
Betwixt Turing and Kleene. LFCS (2022)
Dag Normann, Sam Sanders
On the computational properties of basic mathematical notions. CoRR (2022)
Dag Normann, Sam Sanders
Betwixt Turing and Kleene. CoRR (2021)
Dag Normann, Sam Sanders
The Axiom of Choice in computability theory and Reverse Mathematics with a cameo for the Continuum Hypothesis. J. Log. Comput. 31 (1) (2021)
Dag Normann
Measure-theoretic uniformity and the Suslin functional. Comput. 10 (2) (2021)
Dag Normann, Sam Sanders
Pincherle's theorem in reverse mathematics and computability theory. Ann. Pure Appl. Log. 171 (5) (2020)
Dag Normann, Sam Sanders
Open sets in computability theory and reverse mathematics. J. Log. Comput. 30 (8) (2020)
Dag Normann, Sam Sanders
The strength of compactness in Computability Theory and Nonstandard Analysis. Ann. Pure Appl. Log. 170 (11) (2019)
Dag Normann, Sam Sanders
Computability Theory, Nonstandard Analysis, and their Connections. J. Symb. Log. 84 (4) (2019)
Dag Normann, Sam Sanders
On the mathematical and foundational significance of the uncountable. J. Math. Log. 19 (1) (2019)
Richard Elwes, Andy Lewis-Pye, Benedikt Löwe, Dugald Macpherson, Dag Normann, Andrea Sorbi, Alexandra A. Soskova, Mariya Ivanova Soskova, Peter van Emde Boas, Stanley S. Wainer
S. Barry Cooper (1943-2015). Comput. 7 (2-3) (2018)
Dag Normann
Functionals of Type 3 as Realisers of Classical Theorems in Analysis. CiE (2018)
Dag Normann
→ι form a dcpo for all n ∈ N. Log. Methods Comput. Sci. 14 (1) (2018)
Dag Normann
David Marker, Lectures on Infinitary Model Theory - Series: Lecture Notes in Logic, Vol. 46 2016, pp. 192. ISBN-13: 978-1107181939. Stud Logica 106 (6) (2018)
Dag Normann
→ ι form a dcpo for all n ∈ ℕ. CoRR (2016)
Dag Normann
The extensional realizability model of continuous functionals and three weakly non-constructive classical theorems. Log. Methods Comput. Sci. 11 (1) (2015)
Sam Buss, Benedikt Löwe, Dag Normann, Ivan N. Soskov
Computability in Europe 2011. Ann. Pure Appl. Log. 164 (5) (2013)
Dag Normann, Vladimir Yu. Sazonov
The extensional ordering of the sequential functionals. Ann. Pure Appl. Log. 163 (5) (2012)
Dag Normann
Banach Spaces as Data Types Log. Methods Comput. Sci. 7 (2) (2011)
Dag Normann
A rich hierarchy of functionals of finite types Log. Methods Comput. Sci. 5 (3) (2009)
Dag Normann
Internal Density Theorems for Hierarchies of Continuous Functionals. CiE (2008)
Arnold Beckmann, Benedikt Löwe, Dag Normann
Logical Approaches to Computational Barriers: CiE 2006. J. Log. Comput. 17 (6) (2007)
S. Barry Cooper, Benedikt Löwe, Dag Normann
Mathematics of computing at CiE 2005. Math. Struct. Comput. Sci. 16 (5) (2006)
Dag Normann
On sequential functionals of type 3. Math. Struct. Comput. Sci. 16 (2) (2006)
Dag Normann
Computing with functionals - computability theory or computer science? Bull. Symb. Log. 12 (1) (2006)
Dag Normann
Comparing hierarchies of total functionals. Log. Methods Comput. Sci. 1 (2) (2005)
Dag Normann
Comparing hierarchies of total functionals CoRR (2005)
Dag Normann
Hierarchies of total functionals over the reals. Theor. Comput. Sci. 316 (1) (2004)
Dag Normann
A Nonstandard Characterisation of the Type-structure of Continuous Functionals Over the Reals. Electron. Notes Theor. Comput. Sci. 73 (2004)
Dag Normann
Representation theorems for transfinite computability and definability. Arch. Math. Log. 41 (8) (2002)
Dag Normann, Geir Waagbø
Limit spaces and transfinite types. Arch. Math. Log. 41 (6) (2002)
Dag Normann, Christian Rordam
. Math. Log. Q. 48 (1) (2002)
Dag Normann
Exact real number computations relative to hereditarily total functionals. Theor. Comput. Sci. 284 (2) (2002)
Dag Normann
Continuity, proof systems and the theory of transfinite computations. Arch. Math. Log. 41 (8) (2002)
Dag Normann
Definability of Total Objects in PCF and Related Calculi. TLCA (2001)
Dag Normann
The continuous functionals of finite types over the reals. Electron. Notes Theor. Comput. Sci. 35 (2000)
Dag Normann
The Cook-Berger problem - A guide to the solution. Electron. Notes Theor. Comput. Sci. 35 (2000)
Dag Normann
Computability over The Partial Continuous Functionals. J. Symb. Log. 65 (3) (2000)
Dag Normann, Erik Palmgren, Viggo Stoltenberg-Hansen
Hyperfinite Type Structures. J. Symb. Log. 64 (3) (1999)
Dag Normann
Hereditarily effective typestreams. Arch. Math. Log. 36 (3) (1997)
Dag Normann
. Arch. Math. Log. 36 (4-5) (1997)
Lill Kristiansen, Dag Normann
Total objects in inductively defined types. Arch. Math. Log. 36 (6) (1997)
Lill Kristiansen, Dag Normann
Interpreting higher computations as types with totality. Arch. Math. Log. 33 (4) (1994)
Jean-Yves Girard, Dag Normann
Embeddability of PTYKES. J. Symb. Log. 57 (2) (1992)
Jean-Yves Girard, Dag Normann
Set recursion and Πhalf-logic. Ann. Pure Appl. Log. 28 (3) (1985)
Edward R. Griffor, Dag Normann
The Definability of E(alpha). J. Symb. Log. 49 (2) (1984)
Dag Normann
Characterizing the Continuous Functionals. J. Symb. Log. 48 (4) (1983)
Dag Normann
R.E. degrees of continuous functionals. Arch. Math. Log. 23 (1) (1983)
Dag Normann
General Type-Structures of Continuous and Countable Functionals. Math. Log. Q. 29 (4) (1983)
Dag Normann
Countable Functionals and the Projective Hierarchy. J. Symb. Log. 46 (2) (1981)
Dag Normann, Stanley S. Wainer
The 1-Section of a Countable Functional. J. Symb. Log. 45 (3) (1980)
Dag Normann
A Jump Operator in Set Recursion. Math. Log. Q. 25 (13-18) (1979)
Dag Normann
A Continuous Functional with Noncollapsing Hierarchy. J. Symb. Log. 43 (3) (1978)
Johan Moldestad, Dag Normann
Models for Recursion Theory. J. Symb. Log. 41 (4) (1976)