Models for Recursion Theory. - Johan Moldestad; Dag Normann (J. Symb. Log., 1976)

A Continuous Functional with Noncollapsing Hierarchy. - Dag Normann (J. Symb. Log., 1978)

A Jump Operator in Set Recursion. - Dag Normann (Math. Log. Q., 1979)

The 1-Section of a Countable Functional. - Dag Normann; Stanley S. Wainer (J. Symb. Log., 1980)

Countable Functionals and the Projective Hierarchy. - Dag Normann (J. Symb. Log., 1981)

R.E. degrees of continuous functionals. - Dag Normann (Arch. Math. Log., 1983)

Characterizing the Continuous Functionals. - Dag Normann (J. Symb. Log., 1983)

General Type-Structures of Continuous and Countable Functionals. - Dag Normann (Math. Log. Q., 1983)

The Definability of E(alpha). - Edward R. Griffor; Dag Normann (J. Symb. Log., 1984)

Set recursion and Πhalf-logic. - Jean-Yves Girard 001; Dag Normann (Ann. Pure Appl. Log., 1985)

Embeddability of PTYKES. - Jean-Yves Girard 001; Dag Normann (J. Symb. Log., 1992)

Interpreting higher computations as types with totality. - Lill Kristiansen; Dag Normann (Arch. Math. Log., 1994)

Total objects in inductively defined types. - Lill Kristiansen; Dag Normann (Arch. Math. Log., 1997)

Hereditarily effective typestreams. - Dag Normann (Arch. Math. Log., 1997)

Closing the gap between the continuous functionals and recursion in 3E. - Dag Normann (Arch. Math. Log., 1997)

The Cook-Berger problem - A guide to the solution. - Dag Normann (Workshop on Domains, 1998)

The continuous functionals of finite types over the reals. - Dag Normann (Workshop on Domains, 1998)

The Continuous Functionals. - Dag Normann (Handbook of Computability Theory, 1999)

Hyperfinite Type Structures. - Dag Normann; Erik Palmgren; Viggo Stoltenberg-Hansen (J. Symb. Log., 1999)

Computability over The Partial Continuous Functionals. - Dag Normann (J. Symb. Log., 2000)

Definability of Total Objects in PCF and Related Calculi. - Dag Normann (TLCA, 2001)

Representation theorems for transfinite computability and definability. - Dag Normann (Arch. Math. Log., 2002)

Continuity, proof systems and the theory of transfinite computations. - Dag Normann (Arch. Math. Log., 2002)

Limit spaces and transfinite types. - Dag Normann; Geir Waagbø (Arch. Math. Log., 2002)

A Nonstandard Characterisation of the Type-structure of Continuous Functionals Over the Reals. - Dag Normann (Workshop on Domains, 2002)

The Computational Power of Muomega. - Dag Normann; Christian Rordam (Math. Log. Q., 2002)

Exact real number computations relative to hereditarily total functionals. - Dag Normann (Theor. Comput. Sci., 2002)

Hierarchies of total functionals over the reals. - Dag Normann (Theor. Comput. Sci., 2004)

Comparing hierarchies of total functionals. - Dag Normann (Log. Methods Comput. Sci., 2005)

Computing with functionals - computability theory or computer science? - Dag Normann (Bull. Symb. Log., 2006)

Mathematics of computing at CiE 2005. - S. Barry Cooper; Benedikt Löwe; Dag Normann (Math. Struct. Comput. Sci., 2006)

On sequential functionals of type 3. - Dag Normann (Math. Struct. Comput. Sci., 2006)

Logical Approaches to Computational Barriers: CiE 2006. - Arnold Beckmann; Benedikt Löwe; Dag Normann (J. Log. Comput., 2007)

Internal Density Theorems for Hierarchies of Continuous Functionals. - Dag Normann (CiE, 2008)

A rich hierarchy of functionals of finite types - Dag Normann (Log. Methods Comput. Sci., 2009)

Banach Spaces as Data Types - Dag Normann (Log. Methods Comput. Sci., 2011)

The extensional ordering of the sequential functionals. - Dag Normann; Vladimir Yu. Sazonov (Ann. Pure Appl. Log., 2012)

Computability in Europe 2011. - Sam Buss; Benedikt Löwe; Dag Normann; Ivan N. Soskov (Ann. Pure Appl. Log., 2013)

Higher generalizations of the Turing Model. - Dag Normann (Turing's Legacy, 2014)

Higher-Order Computability - John Longley; Dag Normann (Springer, 2015)

The extensional realizability model of continuous functionals and three weakly non-constructive classical theorems. - Dag Normann (Log. Methods Comput. Sci., 2015)

On the Cantor-Bendixson rank of a set that is searchable in Gödel's T. - Dag Normann (Comput., 2016)

Functionals of Type 3 as Realisers of Classical Theorems in Analysis. - Dag Normann (CiE, 2018)

S. Barry Cooper (1943-2015). - 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 (Comput., 2018)

The sequential functionals of type (ι→ι)n→ι form a dcpo for all n ∈ N. - Dag Normann (Log. Methods Comput. Sci., 2018)

David Marker, Lectures on Infinitary Model Theory - Series: Lecture Notes in Logic, Vol. 46 2016, pp. 192. ISBN-13: 978-1107181939. - Dag Normann (Stud Logica, 2018)

The strength of compactness in Computability Theory and Nonstandard Analysis. - Dag Normann; Sam Sanders (Ann. Pure Appl. Log., 2019)

On the mathematical and foundational significance of the uncountable. - Dag Normann; Sam Sanders (J. Math. Log., 2019)

Computability Theory, Nonstandard Analysis, and their Connections. - Dag Normann; Sam Sanders (J. Symb. Log., 2019)

Pincherle's theorem in reverse mathematics and computability theory. - Dag Normann; Sam Sanders (Ann. Pure Appl. Log., 2020)

Open sets in computability theory and reverse mathematics. - Dag Normann; Sam Sanders (J. Log. Comput., 2020)

Measure-theoretic uniformity and the Suslin functional. - Dag Normann (Comput., 2021)

The Axiom of Choice in computability theory and Reverse Mathematics with a cameo for the Continuum Hypothesis. - Dag Normann; Sam Sanders (J. Log. Comput., 2021)

Betwixt Turing and Kleene. - Dag Normann; Sam Sanders (LFCS, 2022)

On the computational properties of basic mathematical notions. - Dag Normann; Sam Sanders (J. Log. Comput., 2022)

On the Uncountability of ℝ R. - Dag Normann; Sam Sanders (J. Symb. Log., 2022)

Computability and non-monotone induction. - Dag Normann (Comput., 2024)

On robust theorems due to Bolzano, Weierstrass, Jordan, and Cantor. - Dag Normann; Sam Sanders (J. Symb. Log., 2024)

On the logical and computational properties of the Vitali covering theorem. - Dag Normann; Sam Sanders (Ann. Pure Appl. Log., 2025)

The Biggest Five of Reverse Mathematics. - Dag Normann; Sam Sanders (J. Math. Log., 2025)

On some computational properties of open sets. - Dag Normann; Sam Sanders (J. Log. Comput., 2025)