Dag Normann
Use attributes for filter ! | |
Gender | Male |
---|---|
Age | 77 |
Date of birth | May 15,1947 |
Zodiac sign | Taurus |
Date of Reg. | |
Date of Upd. | |
ID | 987575 |
Recursion on the countable functionals
The Continuous Functionals: Computations, Recursions and Degrees
Total Objects in Inductively Defined Types
A Hierarchy of Domains with Totality, But Without Density
Characterizing the Continuous Functionals
Embeddability of Ptykes
Hereditarily Effective Typestreams
Interpreting Higher Computations as Types with Totality
Effective Cofinalities and Admissibility
Set recursion and pi 1,2-logic
On totality
Forcing Arguments and Some Degree-theoretic Problems in Higher Type Recursion Theory
The Recursion Theory of Ptykes
Wellfounded and Non-wellfounded Types of Continuous Functionals
A Non-standard Treatment of the Equation Y'
Higher-Order Computability
The Continuous Functionals: Computations, Recursions and Degrees
Total Objects in Inductively Defined Types
A Hierarchy of Domains with Totality, But Without Density
Characterizing the Continuous Functionals
Embeddability of Ptykes
Hereditarily Effective Typestreams
Interpreting Higher Computations as Types with Totality
Effective Cofinalities and Admissibility
Set recursion and pi 1,2-logic
On totality
Forcing Arguments and Some Degree-theoretic Problems in Higher Type Recursion Theory
The Recursion Theory of Ptykes
Wellfounded and Non-wellfounded Types of Continuous Functionals
A Non-standard Treatment of the Equation Y'
Higher-Order Computability
Dag Normann Life story
Dag Normann is a Norwegian mathematical logician. He was born in 1947 and is Professor emeritus at the University of Oslo. His research focuses on computability theory with an emphasis on mathematical models for typed algorithms and applications of the foundations of mathematics.