Dag Normann

Affiliations:
  • University of Oslo, Norway


According to our database1, Dag Normann authored at least 54 papers between 1976 and 2022.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2022
On the computational properties of basic mathematical notions.
CoRR, 2022

Betwixt Turing and Kleene.
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.
J. Log. Comput., 2021

Measure-theoretic uniformity and the Suslin functional.
Comput., 2021

2020
Open sets in computability theory and reverse mathematics.
J. Log. Comput., 2020

Pincherle's theorem in reverse mathematics and computability theory.
Ann. Pure Appl. Log., 2020

2019
Computability Theory, Nonstandard Analysis, and their Connections.
J. Symb. Log., 2019

On the mathematical and foundational significance of the uncountable.
J. Math. Log., 2019

The strength of compactness in Computability Theory and Nonstandard Analysis.
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.
Stud Logica, 2018

The sequential functionals of type (ι→ι)<sup>n</sup>→ι form a dcpo for all n ∈ N.
Log. Methods Comput. Sci., 2018

S. Barry Cooper (1943-2015).
Comput., 2018

Functionals of Type 3 as Realisers of Classical Theorems in Analysis.
Proceedings of the Sailing Routes in the World of Computation, 2018

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

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

2014
Higher generalizations of the Turing Model.
Proceedings of the Turing's Legacy: Developments from Turing's Ideas in Logic, 2014

2013
Computability in Europe 2011.
Ann. Pure Appl. Log., 2013

2012
The extensional ordering of the sequential functionals.
Ann. Pure Appl. Log., 2012

2011
Banach Spaces as Data Types
Log. Methods Comput. Sci., 2011

2009
A rich hierarchy of functionals of finite types
Log. Methods Comput. Sci., 2009

2008
Internal Density Theorems for Hierarchies of Continuous Functionals.
Proceedings of the Logic and Theory of Algorithms, 2008

2007
Logical Approaches to Computational Barriers: CiE 2006.
J. Log. Comput., 2007

2006
On sequential functionals of type 3.
Math. Struct. Comput. Sci., 2006

Mathematics of computing at CiE 2005.
Math. Struct. Comput. Sci., 2006

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

2005
Comparing hierarchies of total functionals.
Log. Methods Comput. Sci., 2005

2004
Hierarchies of total functionals over the reals.
Theor. Comput. Sci., 2004

A Nonstandard Characterisation of the Type-structure of Continuous Functionals Over the Reals.
Electron. Notes Theor. Comput. Sci., 2004

2002
Exact real number computations relative to hereditarily total functionals.
Theor. Comput. Sci., 2002

The Computational Power of <i>Mu</i><sup>omega</sup>.
Math. Log. Q., 2002

Limit spaces and transfinite types.
Arch. Math. Log., 2002

Continuity, proof systems and the theory of transfinite computations.
Arch. Math. Log., 2002

Representation theorems for transfinite computability and definability.
Arch. Math. Log., 2002

2001
Definability of Total Objects in PCF and Related Calculi.
Proceedings of the Typed Lambda Calculi and Applications, 5th International Conference, 2001

2000
Computability over The Partial Continuous Functionals.
J. Symb. Log., 2000

The continuous functionals of finite types over the reals.
Electron. Notes Theor. Comput. Sci., 2000

The Cook-Berger problem - A guide to the solution.
Electron. Notes Theor. Comput. Sci., 2000

1999
Hyperfinite Type Structures.
J. Symb. Log., 1999

The Continuous Functionals.
Proceedings of the Handbook of Computability Theory, 1999

1997
Closing the gap between the continuous functionals and recursion in <sup>3</sup><i>E</i>.
Arch. Math. Log., 1997

Hereditarily effective typestreams.
Arch. Math. Log., 1997

Total objects in inductively defined types.
Arch. Math. Log., 1997

1994
Interpreting higher computations as types with totality.
Arch. Math. Log., 1994

1992
Embeddability of PTYKES.
J. Symb. Log., 1992

1985
Set recursion and Πhalf-logic.
Ann. Pure Appl. Log., 1985

1984
The Definability of E(alpha).
J. Symb. Log., 1984

1983
General Type-Structures of Continuous and Countable Functionals.
Math. Log. Q., 1983

Characterizing the Continuous Functionals.
J. Symb. Log., 1983

R.E. degrees of continuous functionals.
Arch. Math. Log., 1983

1981
Countable Functionals and the Projective Hierarchy.
J. Symb. Log., 1981

1980
The 1-Section of a Countable Functional.
J. Symb. Log., 1980

1979
A Jump Operator in Set Recursion.
Math. Log. Q., 1979

1978
A Continuous Functional with Noncollapsing Hierarchy.
J. Symb. Log., 1978

1976
Models for Recursion Theory.
J. Symb. Log., 1976


  Loading...