Dag Normann

According to our database, Dag Normann authored at least 60 papers between 1976 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2025

On the logical and computational properties of the Vitali covering theorem.

Dag Normann, Sam Sanders

Ann. Pure Appl. Log., 2025

2024

On robust theorems due to Bolzano, Weierstrass, Jordan, and Cantor.

Dag Normann, Sam Sanders

J. Symb. Log., 2024

On some computational properties of open sets.

Dag Normann, Sam Sanders

CoRR, 2024

Computability and non-monotone induction.

Dag Normann

Comput., 2024

2022

On the Uncountability of ℝ R.

Dag Normann, Sam Sanders

J. Symb. Log., December, 2022

On the computational properties of basic mathematical notions.

Dag Normann, Sam Sanders

J. Log. Comput., 2022

Betwixt Turing and Kleene.

Dag Normann, Sam Sanders

Proceedings of the Logical Foundations of Computer Science - International Symposium, 2022

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

Measure-theoretic uniformity and the Suslin functional.

Dag Normann

Comput., 2021

2020

Open sets in computability theory and reverse mathematics.

Dag Normann, Sam Sanders

J. Log. Comput., 2020

Pincherle's theorem in reverse mathematics and computability theory.

Dag Normann, Sam Sanders

Ann. Pure Appl. Log., 2020

2019

Computability Theory, Nonstandard Analysis, and their Connections.

Dag Normann, Sam Sanders

J. Symb. Log., 2019

On the mathematical and foundational significance of the uncountable.

Dag Normann, Sam Sanders

J. Math. Log., 2019

The strength of compactness in Computability Theory and Nonstandard Analysis.

Dag Normann, Sam Sanders

Ann. Pure Appl. Log., 2019

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 sequential functionals of type (ι→ι)ⁿ→ι form a dcpo for all n ∈ N.

Dag Normann

Log. Methods Comput. Sci., 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

Functionals of Type 3 as Realisers of Classical Theorems in Analysis.

Dag Normann

Proceedings of the Sailing Routes in the World of Computation, 2018

2016

On the Cantor-Bendixson rank of a set that is searchable in Gödel's T.

Dag Normann

Comput., 2016

2015

The extensional realizability model of continuous functionals and three weakly non-constructive classical theorems.

Dag Normann

Log. Methods Comput. Sci., 2015

Higher-Order Computability

John Longley, Dag Normann

Theory and Applications of Computability, Springer, ISBN: 978-3-662-47992-6, 2015

2014

Higher generalizations of the Turing Model.

Dag Normann

Proceedings of the Turing's Legacy: Developments from Turing's Ideas in Logic, 2014

2013

Computability in Europe 2011.

Sam Buss, Benedikt Löwe, Dag Normann, Ivan N. Soskov

Ann. Pure Appl. Log., 2013

2012

The extensional ordering of the sequential functionals.

Dag Normann, Vladimir Yu. Sazonov

Ann. Pure Appl. Log., 2012

2011

Banach Spaces as Data Types

Dag Normann

Log. Methods Comput. Sci., 2011

2009

A rich hierarchy of functionals of finite types

Dag Normann

Log. Methods Comput. Sci., 2009

2008

Internal Density Theorems for Hierarchies of Continuous Functionals.

Dag Normann

Proceedings of the Logic and Theory of Algorithms, 2008

2007

Logical Approaches to Computational Barriers: CiE 2006.

Arnold Beckmann, Benedikt Löwe, Dag Normann

J. Log. Comput., 2007

2006

On sequential functionals of type 3.

Dag Normann

Math. Struct. Comput. Sci., 2006

Mathematics of computing at CiE 2005.

S. Barry Cooper, Benedikt Löwe, Dag Normann

Math. Struct. Comput. Sci., 2006

Computing with functionals - computability theory or computer science?

Dag Normann

Bull. Symb. Log., 2006

2005

Comparing hierarchies of total functionals.

Dag Normann

Log. Methods Comput. Sci., 2005

2004

Hierarchies of total functionals over the reals.

Dag Normann

Theor. Comput. Sci., 2004

2002

Exact real number computations relative to hereditarily total functionals.

Dag Normann

Theor. Comput. Sci., 2002

The Computational Power of <i>Mu</i>^omega.

Dag Normann, Christian Rordam

Math. Log. Q., 2002

A Nonstandard Characterisation of the Type-structure of Continuous Functionals Over the Reals.

Dag Normann

Proceedings of the Workshop on Domains VI 2002, Birmingham, UK, September 16-19, 2002, 2002

Limit spaces and transfinite types.

Dag Normann, Geir Waagbø

Arch. Math. Log., 2002

Continuity, proof systems and the theory of transfinite computations.

Dag Normann

Arch. Math. Log., 2002

Representation theorems for transfinite computability and definability.

Dag Normann

Arch. Math. Log., 2002

2001

Definability of Total Objects in PCF and Related Calculi.

Dag Normann

Proceedings of the Typed Lambda Calculi and Applications, 5th International Conference, 2001

2000

Computability over The Partial Continuous Functionals.

Dag Normann

J. Symb. Log., 2000

1999

Hyperfinite Type Structures.

Dag Normann, Erik Palmgren, Viggo Stoltenberg-Hansen

J. Symb. Log., 1999

The Continuous Functionals.

Dag Normann

Proceedings of the Handbook of Computability Theory, 1999

1998

The continuous functionals of finite types over the reals.

Dag Normann

Proceedings of the Workshop on Domains IV 1998, 1998

The Cook-Berger problem - A guide to the solution.

Dag Normann

Proceedings of the Workshop on Domains IV 1998, 1998

1997

Closing the gap between the continuous functionals and recursion in ³<i>E</i>.

Dag Normann

Arch. Math. Log., 1997

Hereditarily effective typestreams.

Dag Normann

Arch. Math. Log., 1997

Total objects in inductively defined types.

Lill Kristiansen, Dag Normann

Arch. Math. Log., 1997

1994

Interpreting higher computations as types with totality.

Lill Kristiansen, Dag Normann

Arch. Math. Log., 1994

1992

Embeddability of PTYKES.

Jean-Yves Girard, Dag Normann

J. Symb. Log., 1992

1985

Set recursion and Πhalf-logic.

Jean-Yves Girard, Dag Normann

Ann. Pure Appl. Log., 1985

1984

The Definability of E(alpha).

Edward R. Griffor, Dag Normann

J. Symb. Log., 1984

1983

General Type-Structures of Continuous and Countable Functionals.

Dag Normann

Math. Log. Q., 1983

Characterizing the Continuous Functionals.

Dag Normann

J. Symb. Log., 1983

R.E. degrees of continuous functionals.

Dag Normann

Arch. Math. Log., 1983

1981

Countable Functionals and the Projective Hierarchy.

Dag Normann

J. Symb. Log., 1981

1980

The 1-Section of a Countable Functional.

Dag Normann, Stanley S. Wainer

J. Symb. Log., 1980

1979

A Jump Operator in Set Recursion.

Dag Normann

Math. Log. Q., 1979

1978

A Continuous Functional with Noncollapsing Hierarchy.

Dag Normann

J. Symb. Log., 1978

1976

Models for Recursion Theory.

Johan Moldestad, Dag Normann

J. Symb. Log., 1976