Dag Normann - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 59 from 59

2026

On sequential theorems in Reverse MathematicsDag Normann, Sam Sanders. AML, 65(2):275-295, February 2026. [doi]

On the Computational Properties of Ambivalent Sets and FunctionsDag Normann, Sam Sanders. CiE 2027: 514-527 [doi]

2025

The Biggest Five of Reverse MathematicsDag Normann, Sam Sanders. jml, 25(1), 2025. [doi]

On the logical and computational properties of the Vitali covering theoremDag Normann, Sam Sanders. APAL, 176(1):103505, 2025. [doi]

On some computational properties of open setsDag Normann, Sam Sanders. logcom, 35(4), 2025. [doi]

2024

Computability and non-monotone inductionDag Normann. computability, 13(2):161-196, 2024. [doi]

On robust theorems due to Bolzano, Weierstrass, Jordan, and CantorDag Normann, Sam Sanders. JSYML, 89(3):1077-1127, 2024. [doi]

2022

On the Uncountability of ℝ RDag Normann, Sam Sanders. JSYML, 87(4):1474-1521, December 2022. [doi]

On the computational properties of basic mathematical notionsDag Normann, Sam Sanders. logcom, 32(8):1747-1795, 2022. [doi]

Betwixt Turing and KleeneDag Normann, Sam Sanders. lfcs 2022: 236-252 [doi]

2021

Measure-theoretic uniformity and the Suslin functionalDag Normann. computability, 10(2):91-105, 2021. [doi]

The Axiom of Choice in computability theory and Reverse Mathematics with a cameo for the Continuum HypothesisDag Normann, Sam Sanders. logcom, 31(1):297-325, 2021. [doi]

2020

Open sets in computability theory and reverse mathematicsDag Normann, Sam Sanders. logcom, 30(8):1639-1679, 2020. [doi]

Pincherle's theorem in reverse mathematics and computability theoryDag Normann, Sam Sanders. APAL, 171(5):102788, 2020. [doi]

2019

Computability Theory, Nonstandard Analysis, and their ConnectionsDag Normann, Sam Sanders. JSYML, 84(4):1422-1465, 2019. [doi]

The strength of compactness in Computability Theory and Nonstandard AnalysisDag Normann, Sam Sanders. APAL, 170(11), 2019. [doi]

On the mathematical and foundational significance of the uncountableDag Normann, Sam Sanders. jml, 19(1):1950001, 2019. [doi]

2018

2016

On the Cantor-Bendixson rank of a set that is searchable in Gödel's TDag Normann. computability, 5(1):61-74, 2016. [doi]

2015

Higher-Order ComputabilityJohn Longley, Dag Normann. Theory and Applications of Computability, Springer, 2015. [doi]

2014

Higher generalizations of the Turing ModelDag Normann. In Rod Downey, editor, Turing's Legacy: Developments from Turing's Ideas in Logic. Volume 42 of Lecture Notes in Logic, pages 397-433, Cambridge University Press, 2014. [doi]

2013

Computability in Europe 2011Sam Buss, Benedikt Löwe, Dag Normann, Ivan N. Soskov. APAL, 164(5):509-510, 2013. [doi]

2008

Internal Density Theorems for Hierarchies of Continuous FunctionalsDag Normann. cie 2008: 467-475 [doi]

2007

Logical Approaches to Computational Barriers: CiE 2006Arnold Beckmann, Benedikt Löwe, Dag Normann. logcom, 17(6):1021-1023, 2007. [doi]

2006

Mathematics of computing at CiE 2005S. Barry Cooper, Benedikt Löwe, Dag Normann. mscs, 16(5):735-736, 2006. [doi]

On sequential functionals of type 3Dag Normann. mscs, 16(2):279-289, 2006. [doi]

Computing with functionals - computability theory or computer science?Dag Normann. bsl, 12(1):43-59, 2006. [doi]

2005

Comparing hierarchies of total functionalsDag Normann. lmcs, 1(2), 2005. [doi]

2004

Hierarchies of total functionals over the realsDag Normann. TCS, 316(1):137-151, 2004. [doi]

A Nonstandard Characterisation of the Type-structure of Continuous Functionals Over the RealsDag Normann. ENTCS, 73:141-147, 2004. [doi]

2002

Limit spaces and transfinite typesDag Normann, Geir Waagbø. AML, 41(6):525-539, 2002. [doi]

Exact real number computations relative to hereditarily total functionalsDag Normann. TCS, 284(2):437-453, 2002. [doi]

Representation theorems for transfinite computability and definabilityDag Normann. AML, 41(8):721-741, 2002. [doi]

The Computational Power of ::::Mu:::::::omega:::Dag Normann, Christian Rordam. mlq, 48(1):117-124, 2002. [doi]

Continuity, proof systems and the theory of transfinite computationsDag Normann. AML, 41(8):765-788, 2002. [doi]

2001

Definability of Total Objects in PCF and Related CalculiDag Normann. tlca 2001: 4-5 [doi]

2000

The continuous functionals of finite types over the realsDag Normann. ENTCS, 35:163-173, 2000. [doi]

Computability over The Partial Continuous FunctionalsDag Normann. JSYML, 65(3):1133-1142, 2000.

The Cook-Berger problem - A guide to the solutionDag Normann. ENTCS, 35:154-162, 2000. [doi]

1999

Hyperfinite Type StructuresDag Normann, Erik Palmgren, Viggo Stoltenberg-Hansen. JSYML, 64(3):1216-1242, 1999.

The Continuous FunctionalsDag Normann. In Edward R. Griffor, editor, Handbook of Computability Theory. Volume 140 of Studies in Logic and the Foundations of Mathematics, pages 251-275, North-Holland, 1999. [doi]

1997

Total objects in inductively defined typesLill Kristiansen, Dag Normann. AML, 36(6):405-436, 1997. [doi]

Hereditarily effective typestreamsDag Normann. AML, 36(3):219-225, 1997. [doi]

Closing the gap between the continuous functionals and recursion in :::3:::::::E::::Dag Normann. AML, 36(4-5):269-287, 1997. [doi]

1994

Interpreting higher computations as types with totalityLill Kristiansen, Dag Normann. AML, 33(4):243-259, 1994. [doi]

1992

Embeddability of PTYKESJean-Yves Girard, Dag Normann. JSYML, 57(2):659-676, 1992.

1985

Set recursion and Πhalf-logicJean-Yves Girard, Dag Normann. APAL, 28(3):255-286, 1985. [doi]

1984

The Definability of E(alpha)Edward R. Griffor, Dag Normann. JSYML, 49(2):437-442, 1984.

1983

General Type-Structures of Continuous and Countable FunctionalsDag Normann. mlq, 29(4):177-192, 1983. [doi]

R.E. degrees of continuous functionalsDag Normann. AML, 23(1):79-98, 1983. [doi]

Characterizing the Continuous FunctionalsDag Normann. JSYML, 48(4):965-969, 1983.

1981

Countable Functionals and the Projective HierarchyDag Normann. JSYML, 46(2):209-215, 1981.

1980

The 1-Section of a Countable FunctionalDag Normann, Stanley S. Wainer. JSYML, 45(3):549-562, 1980.

1979

A Jump Operator in Set RecursionDag Normann. mlq, 25(13-18):251-264, 1979. [doi]

1978

A Continuous Functional with Noncollapsing HierarchyDag Normann. JSYML, 43(3):487-491, 1978.

1976

Models for Recursion TheoryJohan Moldestad, Dag Normann. JSYML, 41(4):719-729, 1976.

Sign in or sign up to see more results.

runs on WebDSL