Dag Normann

982 total citations
54 papers, 308 citations indexed

About

Dag Normann is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Geometry and Topology. According to data from OpenAlex, Dag Normann has authored 54 papers receiving a total of 308 indexed citations (citations by other indexed papers that have themselves been cited), including 39 papers in Computational Theory and Mathematics, 25 papers in Artificial Intelligence and 17 papers in Geometry and Topology. Recurrent topics in Dag Normann's work include Computability, Logic, AI Algorithms (33 papers), Logic, Reasoning, and Knowledge (19 papers) and Advanced Topology and Set Theory (16 papers). Dag Normann is often cited by papers focused on Computability, Logic, AI Algorithms (33 papers), Logic, Reasoning, and Knowledge (19 papers) and Advanced Topology and Set Theory (16 papers). Dag Normann collaborates with scholars based in Norway, Germany and United Kingdom. Dag Normann's co-authors include Sam Sanders, John Longley, Jens Erik Fenstad, Jean-Yves Girard, L. A. Kristiansen, Ludomir Newelski, Benedikt Löwe, John R. Steel, Edward Griffor and Erik Palmgren and has published in prestigious journals such as Lecture notes in mathematics, Theoretical Computer Science and Lecture notes in computer science.

In The Last Decade

Dag Normann

48 papers receiving 275 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Dag Normann Norway 10 248 203 94 82 27 54 308
Wilfried Buchholz Germany 11 338 1.4× 278 1.4× 85 0.9× 38 0.5× 16 0.6× 25 423
Andreas Weiermann Belgium 10 345 1.4× 171 0.8× 137 1.5× 38 0.5× 40 1.5× 69 419
Stanley S. Wainer United Kingdom 9 207 0.8× 132 0.7× 57 0.6× 29 0.4× 16 0.6× 21 242
Matthias Schröder Germany 9 275 1.1× 131 0.6× 153 1.6× 98 1.2× 15 0.6× 32 349
Peter Cholak United States 12 336 1.4× 91 0.4× 147 1.6× 28 0.3× 64 2.4× 45 367
Piergiorgio Odifreddi Italy 5 172 0.7× 92 0.5× 44 0.5× 26 0.3× 27 1.0× 15 210
Wolfram Pohlers Germany 8 224 0.9× 177 0.9× 61 0.6× 35 0.4× 15 0.6× 17 292
Toshiyasu Arai Japan 10 136 0.5× 79 0.4× 51 0.5× 23 0.3× 10 0.4× 42 181
J. W. Addison United States 7 150 0.6× 75 0.4× 88 0.9× 39 0.5× 7 0.3× 9 227
Erik Palmgren Sweden 13 250 1.0× 243 1.2× 150 1.6× 195 2.4× 3 0.1× 61 444

Countries citing papers authored by Dag Normann

Since Specialization
Citations

This map shows the geographic impact of Dag Normann's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Dag Normann with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Dag Normann more than expected).

Fields of papers citing papers by Dag Normann

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Dag Normann. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Dag Normann. The network helps show where Dag Normann may publish in the future.

Co-authorship network of co-authors of Dag Normann

This figure shows the co-authorship network connecting the top 25 collaborators of Dag Normann. A scholar is included among the top collaborators of Dag Normann based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Dag Normann. Dag Normann is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Normann, Dag & Sam Sanders. (2024). On some computational properties of open sets. Journal of Logic and Computation. 35(4).
2.
Normann, Dag & Sam Sanders. (2022). ON THE UNCOUNTABILITY OF. Journal of Symbolic Logic. 87(4). 1474–1521. 3 indexed citations
3.
Normann, Dag & Sam Sanders. (2020). Pincherle's theorem in reverse mathematics and computability theory. Annals of Pure and Applied Logic. 171(5). 102788–102788. 15 indexed citations
4.
Normann, Dag. (2011). Banach Spaces as Data Types. Logical Methods in Computer Science. Volume 7, Issue 2. 1 indexed citations
5.
Löwe, Benedikt, et al.. (2011). Proceedings of the 7th conference on Models of computation in context: computability in Europe. 1 indexed citations
6.
Normann, Dag. (2009). A rich hierarchy of functionals of finite types. Logical Methods in Computer Science. Volume 5, Issue 3. 5 indexed citations
7.
Newelski, Ludomir, et al.. (2007). Logic Colloquium 2005. Cambridge University Press eBooks. 9 indexed citations
8.
Normann, Dag. (2006). On sequential functionals of type 3. Mathematical Structures in Computer Science. 16(2). 279–289. 5 indexed citations
9.
Normann, Dag. (2004). Hierarchies of total functionals over the reals. Theoretical Computer Science. 316(1-3). 137–151. 2 indexed citations
10.
Normann, Dag. (2004). A Nonstandard Characterisation of the Type-structure of Continuous Functionals Over the Reals. Electronic Notes in Theoretical Computer Science. 73. 141–147. 1 indexed citations
11.
Normann, Dag. (1997). Hereditarily effective typestreams. Archive for Mathematical Logic. 36(3). 219–225. 1 indexed citations
12.
Kristiansen, L. A. & Dag Normann. (1997). Total objects in inductively defined types. Archive for Mathematical Logic. 36(6). 405–436. 9 indexed citations
13.
Girard, Jean-Yves & Dag Normann. (1985). Set recursion and Πhalf-logic. Annals of Pure and Applied Logic. 28(3). 255–286. 8 indexed citations
14.
Normann, Dag. (1984). THE RECURSION THEORY OF PTYKES. Duo Research Archive (University of Oslo). 1 indexed citations
15.
Normann, Dag. (1983). Characterizing the continuous functionals. Journal of Symbolic Logic. 48(4). 965–969. 3 indexed citations
16.
Normann, Dag, et al.. (1981). RECURSIVE ENUMERABILITY AND INDEXICALITY IN E-RECURSION. Duo Research Archive (University of Oslo).
17.
Normann, Dag. (1981). The continuous functionals; computations, recursions and degrees. Annals of Mathematical Logic. 21(1). 1–26. 7 indexed citations
18.
Normann, Dag, et al.. (1980). The 1-section of a countable functional. Journal of Symbolic Logic. 45(3). 549–562. 4 indexed citations
19.
Normann, Dag. (1980). Recursion on the Countable Functionals. Lecture notes in mathematics. 45 indexed citations
20.
Normann, Dag. (1979). Degrees of functionals. Annals of Mathematical Logic. 16(3). 269–304. 1 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Breakdown of academic impact, for papers by Wilfried Buchholz Breakdown of academic impact, for papers by Andreas Weiermann Breakdown of academic impact, for papers by Stanley S. Wainer Breakdown of academic impact, for papers by Matthias Schröder Breakdown of academic impact, for papers by Peter Cholak Breakdown of academic impact, for papers by Piergiorgio Odifreddi Breakdown of academic impact, for papers by Wolfram Pohlers Breakdown of academic impact, for papers by Toshiyasu Arai Breakdown of academic impact, for papers by J. W. Addison Breakdown of academic impact, for papers by Erik Palmgren
Rankless by CCL
2026