Dag Normann

Dag Normann's AcademicInfluence.com Rankings

Dag Normann

Mathematics

#8105

World Rank

#11007

Historical Rank

Group Theory

#297

World Rank

#348

Historical Rank

Algebra

#659

World Rank

#869

Historical Rank

Measure Theory

#3735

World Rank

#4404

Historical Rank

mathematics Degrees

Download Badge

Mathematics

Why Is Dag Normann Influential?

(Suggest an Edit or Addition)

According to Wikipedia, 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.

(See a Problem?)

Dag Normann's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Logic Colloquium 2005 (Lecture Notes in Logic) (2007) (121)
Higher-Order Computability (2015) (100)
Recursion on the countable functionals (1980) (92)
The countable functionals (1980) (89)
Logical Approaches to Computational Barriers: CiE 2006 (2007) (71)
The Continuous Functionals (1999) (42)
On the mathematical and foundational significance of the uncountable (2017) (35)
Computability over the partial continuous functionals (2000) (31)
The continuous functionals of finite types over the reals (1998) (26)
A hierarchy of domains with totality, but without density (1996) (25)
ON ABSOLUTELY MEASURABLE SETS (1974) (24)
Pincherle's theorem in reverse mathematics and computability theory (2018) (24)
Mathematics of Computation at CiE 2005 (2006) (20)
Computing with Functionals—Computability Theory or Computer Science? (2006) (20)
On sequential functionals of type 3 (2006) (19)
Closing the gap between the continuous functionals and recursion in $^3E$ (1997) (17)
The strength of compactness in Computability Theory and Nonstandard Analysis (2018) (16)
COMPUTABILITY THEORY, NONSTANDARD ANALYSIS, AND THEIR CONNECTIONS (2017) (16)
Total objects in inductively defined types (1997) (16)
The Computational Power of ℳ︁ω (2002) (16)
Categories of domains with totality (1997) (14)
Comparing hierarchies of total functionals (2005) (14)
Semantics for some constructors of type theory (1995) (13)
The continuous functionals; computations, recursions and degrees (1981) (12)
Mathematical Logic II (2005) (11)
The extensional ordering of the sequential functionals (2012) (11)
MARTINS AXIOM AND MEDIAL FUNCTIONS (1976) (11)
Formalizing the Notion of Total Information (1990) (11)
Functionals of Type 3 as Realisers of Classical Theorems in Analysis (2018) (10)
On the computational properties of basic mathematical notions (2022) (8)
Exact real number computations relative to hereditarily total functionals (2002) (7)
Degrees of functionals (1979) (7)
Set recursion and Πhalf-logic (1985) (7)
Open sets in computability theory and reverse mathematics (2019) (7)
Countable functionals and the projective hierarchy (1981) (7)
Hyperfinite type structures (1999) (7)
The 1-section of a countable functional (1980) (7)
Wellfounded and non-wellfounded types of continuous functionals (1992) (7)
A rich hierarchy of functionals of finite types (2009) (7)
Hierarchies of total functionals over the reals (2004) (6)
Applications of the Kleene–Kreisel Density Theorem to Theoretical Computer Science (2008) (6)
Characterizing the continuous functionals (1983) (5)
EFFECTIVE COFINALITIES AND ADMISSIBILITY IN E-RECURSION (1984) (5)
The Axiom of Choice in computability theory and Reverse Mathematics with a cameo for the Continuum Hypothesis (2020) (5)
IMBEDDING OF HIGHER TYPE THEORIES (1974) (5)
Internal Density Theorems for Hierarchies of Continuous Functionals (2008) (5)
External and Internal Algorithms on the Continuous Functionals (1982) (4)
Models for recursion theory (1976) (4)
Limit spaces and transfinite types (2002) (4)
ON THE UNCOUNTABILITY OF ${\mathbb R}$ (2020) (3)
The Cook-Berger problem - A guide to the solution (1998) (3)
A continuous functional with noncollapsing hierarchy (1978) (3)
Embeddability of ptykes (1992) (3)
Experiments on an Internal Approach to Typed Algorithms in Analysis (2011) (3)
Hereditarily effective typestreams (1997) (3)
A note on reflection. (1979) (2)
Recursion Theory: its Generalisations and Applications: The Recursion Theory of the Continuous Functionals (1980) (2)
On the Cantor–Bendixson rank of a set that is searchable in Gödel’s T (2016) (2)
Computability and Non-monotone induction (2020) (2)
Banach Spaces as Data Types (2011) (2)
Non-Obtainable Continuous Functionals* (1982) (2)
A non-standard treatment of the equation y'= f(y,t) (1980) (2)
COUNTABLE FUNCTIONALS AND THE ANALYTIC HIERARCHY (1977) (2)
A Mahlo-universe of effective domains with totality (1996) (2)
The Continuous Functionals as Limit Spaces (2012) (2)
3 PAUL BERNAYS’LATER PHILOSOPHY OF MATHEMATICS (2007) (2)
Continuity, proof systems and the theory of transfinite computations (2002) (1)
2-envelopes and the analytic hierarchy (1974) (1)
On abstract 1-sections (1974) (1)
The definability of E(α) (1984) (1)
Proceedings of the 7th conference on Models of computation in context: computability in Europe (2011) (1)
Higher generalizations of the Turing Model (2014) (1)
A Nonstandard Characterisation of the Type-structure of Continuous Functionals Over the Reals (2004) (1)
Representations in measure theory: between a non-computable rock and a hard to prove place. (2019) (1)
On the Computability of the Fan Functional (2017) (1)
On robust theorems due to Bolzano, Weierstrass, Cantor, and Jordan (2021) (1)
The extensional realizability model of continuous functionals and three weakly non-constructive classical theorems (2015) (1)
R.E. degrees of continuous functionals (1983) (1)
THE RECURSION THEORY OF PTYKES (1984) (1)
Representation theorems for transfinite computability and definability (2002) (1)
Measure-theoretic uniformity and the Suslin functional (2018) (1)
The Biggest Five of Reverse Mathematics (2022) (1)
Theory of λ-Algebras (2015) (1)
The sequential functionals of type (ι→ι)n → ι form a dcpo for all n ∈ ℕ (2018) (1)
Review: Arnold Beckmann, Wolfram Pohlers, Applications of Cut-Free Infinitary Derivations to Generalized Recursion Theory (2000) (1)
Theory of Computability Models (2015) (1)
A Non-Adequate Admissible Set with a Good Degree-Structure (1978) (0)
Skordev Dimiter G.. Computability in combinatory spaces. An algebraic generalization of abstract first order computability . Mathematics and its applications (East European series), vol. 55. Kluwer Academic publishers, Dordrecht, Boston, and London, 1992, xiv + 320 pp. (1995) (0)
Definability of Total Objects in PCF and Related Calculi (2001) (0)
The Computational Power of ℳ (2002) (0)
Review: L. L. Ivanov, J. L. Bell, Algebraic Recursion Theory (1988) (0)
Review: Akira Kanda, Recursion Theorems and Effective Domains (1991) (0)
PCF and Its Models (2015) (0)
The computable structure on Ct(k) (1980) (0)
A Jump Operator in Set Recursion (1979) (0)
Computability vs recursion (1980) (0)
General Type-Structures of Continuous and Countable Functionals (1983) (0)
The Axiom of Choice , the Well Ordering Principle and Zorn ’ s Lemma (2012) (0)
David Marker, Lectures on Infinitary Model Theory (2018) (0)
S. Barry Cooper (1943-2015) (2018) (0)
On the logical and computational properties of the Vitali covering theorem (2019) (0)
The Definability of E(alpha) (1984) (0)
Forcing arguments and some degree-theoretic problems in higher type recursion theory (1975) (0)
The Partial Continuous Functionals (2015) (0)
Introduction to Computability Theory (2010) (0)
ON ROBUST THEOREMS DUE TO BOLZANO, WEIERSTRASS, JORDAN, AND CANTOR (2022) (0)
THE SEQUENTIAL FUNCTIONALS OF TYPE ( ι → ι ) n → ι FORM (2018) (0)
The Computational Power of Muomega (2002) (0)
On a problem of S. Wainer (The real ordinal of the 1-section of a continuous functional) (1976) (0)
Some further results and topics (1980) (0)
Arnold Beckmann and Wolfram Pohlers. Applications of cut-free infinitary derivations to generalized recursion theory. Annals of pure and applied logic , vol. 94 (1998), pp. 7–19. (2000) (0)
Ct(n) as a topological space (1980) (0)
A Survey of Set Recursion (2010) (0)
The maximal type structure (1980) (0)
The sequential functionals of type $(\iota \rightarrow \iota)^n \rightarrow \iota$ form a dcpo for all $n \in \Bbb N$ (2016) (0)
Kanda Akira. Recursion theorems and effective domains. Annals of pure and applied logic , vol. 38 (1988), pp. 289–300. (1991) (0)
The Hereditarily Effective Operations (2015) (0)
RECURSIVE ENUMERABILITY AND INDEXICALITY IN E-RECURSION (1981) (0)
Definability and reducibility in higher types over the reals (2016) (0)
David Marker, Lectures on Infinitary Model Theory (2018) (0)
Gerald E. Sacks. Higher recursion theory . Perspectives in mathematical logic. Springer-Verlag, Berlin etc. 1990, xv + 344 pp. (1992) (0)
Lawrence S. Moss. Power set recursion. Annals of pure and applied logic , vol. 71 (1995), pp. 247–306. (1996) (0)
Related and Future Work (2015) (0)
The Computational Power of Mu omega . (2002) (0)
Mathematics of computing at CiE 2005 (2006) (0)
Introduction and Motivations (2015) (0)
The Total Continuous Functionals (2015) (0)
Kleene Computability in a Total Setting (2015) (0)
Some Intensional Models (2015) (0)
The Computational Power of M (2002) (0)
The Computational Power of M^o^m^e^g^a (2002) (0)
Review: Lawrence S. Moss, Power Set Recursion (1996) (0)
Nested Sequential Procedures (2015) (0)
Computability in Europe 2011 (2013) (0)
Betwixt Turing and Kleene (2021) (0)
Logic Colloquium 2005: Speakers and Titles (2007) (0)
Review: Gerald E. Sacks, Higher Recursion Theory (1992) (0)
Recursion in 3 E and a Splitting Theorem (1979) (0)

This paper list is powered by the following services:

Other Resources About Dag Normann

en.wikipedia.org

What Schools Are Affiliated With Dag Normann?

Dag Normann is affiliated with the following schools:

University of Oslo

Dag Normann's Academic­Influence.com Rankings

Why Is Dag Normann Influential?

Dag Normann's Published Works

Published Works

Other Resources About Dag Normann

What Schools Are Affiliated With Dag Normann?

Dag Normann's AcademicInfluence.com Rankings