default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDag Normann
Person information
- affiliation: University of Oslo, Norway
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j49]Dag Normann, Sam Sanders:
On the logical and computational properties of the Vitali covering theorem. Ann. Pure Appl. Log. 176(1): 103505 (2025)- 2024
- [j48]Dag Normann:
Computability and non-monotone induction. Comput. 13(2): 161-196 (2024) - [j47]Dag Normann, Sam Sanders:
On robust theorems due to Bolzano, Weierstrass, Jordan, and Cantor. J. Symb. Log. 89(3): 1077-1127 (2024) - [i5]Dag Normann, Sam Sanders:
On some computational properties of open sets. CoRR abs/2401.09053 (2024) - 2022
- [j46]Dag Normann, Sam Sanders:
On the Uncountability of ℝ R. J. Symb. Log. 87(4): 1474-1521 (2022) - [j45]Dag Normann, Sam Sanders:
On the computational properties of basic mathematical notions. J. Log. Comput. 32(8): 1747-1795 (2022) - [c7]Dag Normann, Sam Sanders:
Betwixt Turing and Kleene. LFCS 2022: 236-252 - [i4]Dag Normann, Sam Sanders:
On the computational properties of basic mathematical notions. CoRR abs/2203.05250 (2022) - 2021
- [j44]Dag Normann:
Measure-theoretic uniformity and the Suslin functional. Comput. 10(2): 91-105 (2021) - [j43]Dag Normann, Sam Sanders:
The Axiom of Choice in computability theory and Reverse Mathematics with a cameo for the Continuum Hypothesis. J. Log. Comput. 31(1): 297-325 (2021) - [i3]Dag Normann, Sam Sanders:
Betwixt Turing and Kleene. CoRR abs/2109.01352 (2021) - 2020
- [j42]Dag Normann, Sam Sanders:
Pincherle's theorem in reverse mathematics and computability theory. Ann. Pure Appl. Log. 171(5): 102788 (2020) - [j41]Dag Normann, Sam Sanders:
Open sets in computability theory and reverse mathematics. J. Log. Comput. 30(8): 1639-1679 (2020)
2010 – 2019
- 2019
- [j40]Dag Normann, Sam Sanders:
The strength of compactness in Computability Theory and Nonstandard Analysis. Ann. Pure Appl. Log. 170(11) (2019) - [j39]Dag Normann, Sam Sanders:
On the mathematical and foundational significance of the uncountable. J. Math. Log. 19(1): 1950001:1-1950001:40 (2019) - [j38]Dag Normann, Sam Sanders:
Computability Theory, Nonstandard Analysis, and their Connections. J. Symb. Log. 84(4): 1422-1465 (2019) - 2018
- [j37]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:
S. Barry Cooper (1943-2015). Comput. 7(2-3): 103-131 (2018) - [j36]Dag Normann:
The sequential functionals of type (ι→ι)n→ι form a dcpo for all n ∈ N. Log. Methods Comput. Sci. 14(1) (2018) - [j35]Dag Normann:
David Marker, Lectures on Infinitary Model Theory - Series: Lecture Notes in Logic, Vol. 46 2016, pp. 192. ISBN-13: 978-1107181939. Stud Logica 106(6): 1319-1323 (2018) - [c6]Dag Normann:
Functionals of Type 3 as Realisers of Classical Theorems in Analysis. CiE 2018: 318-327 - 2016
- [j34]Dag Normann:
On the Cantor-Bendixson rank of a set that is searchable in Gödel's T. Comput. 5(1): 61-74 (2016) - [i2]Dag Normann:
The sequential functionals of type (ι→ι)n → ι form a dcpo for all n ∈ ℕ. CoRR abs/1607.02970 (2016) - 2015
- [b1]John Longley, Dag Normann:
Higher-Order Computability. Theory and Applications of Computability, Springer 2015, ISBN 978-3-662-47991-9, pp. 3-546 - [j33]Dag Normann:
The extensional realizability model of continuous functionals and three weakly non-constructive classical theorems. Log. Methods Comput. Sci. 11(1) (2015) - 2014
- [p2]Dag Normann:
Higher generalizations of the Turing Model. Turing's Legacy 2014: 397-433 - 2013
- [j32]Sam Buss, Benedikt Löwe, Dag Normann, Ivan N. Soskov:
Computability in Europe 2011. Ann. Pure Appl. Log. 164(5): 509-510 (2013) - 2012
- [j31]Dag Normann, Vladimir Yu. Sazonov:
The extensional ordering of the sequential functionals. Ann. Pure Appl. Log. 163(5): 575-603 (2012) - 2011
- [j30]Dag Normann:
Banach Spaces as Data Types. Log. Methods Comput. Sci. 7(2) (2011) - [e1]Benedikt Löwe, Dag Normann, Ivan N. Soskov, Alexandra A. Soskova:
Models of Computation in Context - 7th Conference on Computability in Europe, CiE 2011, Sofia, Bulgaria, June 27 - July 2, 2011. Proceedings. Lecture Notes in Computer Science 6735, Springer 2011, ISBN 978-3-642-21874-3 [contents]
2000 – 2009
- 2009
- [j29]Dag Normann:
A rich hierarchy of functionals of finite types. Log. Methods Comput. Sci. 5(3) (2009) - 2008
- [c5]Dag Normann:
Internal Density Theorems for Hierarchies of Continuous Functionals. CiE 2008: 467-475 - 2007
- [j28]Arnold Beckmann, Benedikt Löwe, Dag Normann:
Logical Approaches to Computational Barriers: CiE 2006. J. Log. Comput. 17(6): 1021-1023 (2007) - 2006
- [j27]Dag Normann:
Computing with functionals - computability theory or computer science? Bull. Symb. Log. 12(1): 43-59 (2006) - [j26]Dag Normann:
On sequential functionals of type 3. Math. Struct. Comput. Sci. 16(2): 279-289 (2006) - [j25]S. Barry Cooper, Benedikt Löwe, Dag Normann:
Mathematics of computing at CiE 2005. Math. Struct. Comput. Sci. 16(5): 735-736 (2006) - 2005
- [j24]Dag Normann:
Comparing hierarchies of total functionals. Log. Methods Comput. Sci. 1(2) (2005) - [i1]Dag Normann:
Comparing hierarchies of total functionals. CoRR abs/cs/0509019 (2005) - 2004
- [j23]Dag Normann:
Hierarchies of total functionals over the reals. Theor. Comput. Sci. 316(1): 137-151 (2004) - 2002
- [j22]Dag Normann, Geir Waagbø:
Limit spaces and transfinite types. Arch. Math. Log. 41(6): 525-539 (2002) - [j21]Dag Normann:
Representation theorems for transfinite computability and definability. Arch. Math. Log. 41(8): 721-741 (2002) - [j20]Dag Normann:
Continuity, proof systems and the theory of transfinite computations. Arch. Math. Log. 41(8): 765-788 (2002) - [j19]Dag Normann, Christian Rordam:
The Computational Power of Muomega. Math. Log. Q. 48(1): 117-124 (2002) - [j18]Dag Normann:
Exact real number computations relative to hereditarily total functionals. Theor. Comput. Sci. 284(2): 437-453 (2002) - [c4]Dag Normann:
A Nonstandard Characterisation of the Type-structure of Continuous Functionals Over the Reals. Workshop on Domains 2002: 141-147 - 2001
- [c3]Dag Normann:
Definability of Total Objects in PCF and Related Calculi. TLCA 2001: 4-5 - 2000
- [j17]Dag Normann:
Computability over The Partial Continuous Functionals. J. Symb. Log. 65(3): 1133-1142 (2000)
1990 – 1999
- 1999
- [j16]Dag Normann, Erik Palmgren, Viggo Stoltenberg-Hansen:
Hyperfinite Type Structures. J. Symb. Log. 64(3): 1216-1242 (1999) - [p1]Dag Normann:
The Continuous Functionals. Handbook of Computability Theory 1999: 251-275 - 1998
- [c2]Dag Normann:
The Cook-Berger problem - A guide to the solution. Workshop on Domains 1998: 154-162 - [c1]Dag Normann:
The continuous functionals of finite types over the reals. Workshop on Domains 1998: 163-173 - 1997
- [j15]Dag Normann:
Hereditarily effective typestreams. Arch. Math. Log. 36(3): 219-225 (1997) - [j14]Dag Normann:
Closing the gap between the continuous functionals and recursion in 3E. Arch. Math. Log. 36(4-5): 269-287 (1997) - [j13]Lill Kristiansen, Dag Normann:
Total objects in inductively defined types. Arch. Math. Log. 36(6): 405-436 (1997) - 1994
- [j12]Lill Kristiansen, Dag Normann:
Interpreting higher computations as types with totality. Arch. Math. Log. 33(4): 243-259 (1994) - 1992
- [j11]Jean-Yves Girard, Dag Normann:
Embeddability of PTYKES. J. Symb. Log. 57(2): 659-676 (1992)
1980 – 1989
- 1985
- [j10]Jean-Yves Girard, Dag Normann:
Set recursion and Πhalf-logic. Ann. Pure Appl. Log. 28(3): 255-286 (1985) - 1984
- [j9]Edward R. Griffor, Dag Normann:
The Definability of E(alpha). J. Symb. Log. 49(2): 437-442 (1984) - 1983
- [j8]Dag Normann:
R.E. degrees of continuous functionals. Arch. Math. Log. 23(1): 79-98 (1983) - [j7]Dag Normann:
Characterizing the Continuous Functionals. J. Symb. Log. 48(4): 965-969 (1983) - [j6]Dag Normann:
General Type-Structures of Continuous and Countable Functionals. Math. Log. Q. 29(4): 177-192 (1983) - 1981
- [j5]Dag Normann:
Countable Functionals and the Projective Hierarchy. J. Symb. Log. 46(2): 209-215 (1981) - 1980
- [j4]Dag Normann, Stanley S. Wainer:
The 1-Section of a Countable Functional. J. Symb. Log. 45(3): 549-562 (1980)
1970 – 1979
- 1979
- [j3]Dag Normann:
A Jump Operator in Set Recursion. Math. Log. Q. 25(13-18): 251-264 (1979) - 1978
- [j2]Dag Normann:
A Continuous Functional with Noncollapsing Hierarchy. J. Symb. Log. 43(3): 487-491 (1978) - 1976
- [j1]Johan Moldestad, Dag Normann:
Models for Recursion Theory. J. Symb. Log. 41(4): 719-729 (1976)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:14 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
