Dag Normann

From MaRDI portal
(Redirected from Person:1063590)



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
On sequential theorems in reverse mathematics
Archive for Mathematical Logic
2026-02-16Paper
On robust theorems due to Bolzano, Weierstrass, Jordan, and Cantor
Journal of Symbolic Logic
2024-11-25Paper
On the logical and computational properties of the Vitali covering theorem
Annals of Pure and Applied Logic
2024-10-07Paper
Computability and non-monotone induction
Computability
2024-08-29Paper
On the computational properties of basic mathematical notions
Journal Of Logic And Computation
2023-01-04Paper
The Biggest Five of Reverse Mathematics2022-12-01Paper
On the uncountability of \(\mathbb{R}\)
Journal of Symbolic Logic
2022-11-18Paper
Betwixt Turing and Kleene
(available as arXiv preprint)
2022-07-01Paper
The axiom of choice in computability theory and reverse mathematics with a cameo for the continuum hypothesis
Journal Of Logic And Computation
2022-02-08Paper
Betwixt Turing and Kleene
(available as arXiv preprint)
2021-09-03Paper
Measure-theoretic uniformity and the Suslin functional
Computability
2021-06-25Paper
On robust theorems due to Bolzano, Weierstrass, Cantor, and Jordan2021-02-09Paper
Open sets in computability theory and reverse mathematics
Journal Of Logic And Computation
2020-12-15Paper
On the uncountability of $\mathbb{R}$
(available as arXiv preprint)
2020-07-15Paper
Computability and Non-monotone induction2020-06-05Paper
The Axiom of Choice in Computability Theory and Reverse Mathematics, with a cameo for the Continuum Hypothesis
(available as arXiv preprint)
2020-05-30Paper
Pincherle's theorem in reverse mathematics and computability theory
Annals of Pure and Applied Logic
2020-03-12Paper
On the computability of the fan functional
Outstanding Contributions to Logic
2020-02-05Paper
Computability theory, nonstandard analysis, and their connections
Journal of Symbolic Logic
2020-01-10Paper
Computability theory, nonstandard analysis, and their connections
Journal of Symbolic Logic
2020-01-10Paper
The strength of compactness in computability theory and nonstandard analysis
Annals of Pure and Applied Logic
2019-10-07Paper
The strength of compactness in computability theory and nonstandard analysis
Annals of Pure and Applied Logic
2019-10-07Paper
On the mathematical and foundational significance of the uncountable
Journal of Mathematical Logic
2019-07-08Paper
On the logical and computational properties of the Vitali covering theorem2019-02-07Paper
Book review of: D. Marker, Lectures on infinitary model theory
Studia Logica
2018-12-21Paper
Measure-theoretic Uniformity and the Suslin Functional
(available as arXiv preprint)
2018-10-17Paper
S. Barry Cooper (1943–2015)
Computability
2018-09-20Paper
Functionals of type 3 as realisers of classical theorems in analysis2018-09-06Paper
The sequential functionals of type \((\iota \rightarrow \iota)^n \rightarrow \iota\) form a \textit{dcpo} for all \(n \in \mathbb N\)
(available as arXiv preprint)
2018-04-25Paper
On the Cantor-Bendixson rank of a set that is searchable in Gödel's \(T\)
Computability
2016-04-13Paper
Higher-order computability
Theory and Applications of Computability
2015-12-16Paper
The extensional realizability model of continuous functionals and three weakly non-constructive classical theorems
Logical Methods in Computer Science
2015-03-17Paper
The continuous functionals as limit spaces2014-06-24Paper
A nonstandard characterisation of the type-structure of continuous functionals over the reals2013-10-10Paper
Experiments on an internal approach to typed algorithms in analysis2012-09-05Paper
The extensional ordering of the sequential functionals
Annals of Pure and Applied Logic
2012-03-13Paper
A rich hierarchy of functionals of finite types
Logical Methods in Computer Science
2011-06-28Paper
Banach spaces as data types
Logical Methods in Computer Science
2011-05-26Paper
Internal Density Theorems for Hierarchies of Continuous Functionals
Logic and Theory of Algorithms
2008-06-19Paper
Applications of the Kleene-Kreisel density theorem to theoretical computer science2008-04-29Paper
Comparing hierarchies of total functionals
Logical Methods in Computer Science
2007-10-11Paper
On sequential functionals of type 3
Mathematical Structures in Computer Science
2006-08-10Paper
Computing with Functionals—Computability Theory or Computer Science?
The Bulletin of Symbolic Logic
2006-07-10Paper
Definability and reducibility in higher types over the reals2006-07-03Paper
scientific article; zbMATH DE number 2197810 (Why is no real title available?)2005-08-23Paper
Hierarchies of total functionals over the reals
Theoretical Computer Science
2004-08-04Paper
Limit spaces and transfinite types
Archive for Mathematical Logic
2003-09-16Paper
Representation theorems for transfinite computability and definability
Archive for Mathematical Logic
2003-09-16Paper
Continuity, proof systems and the theory of transfinite computations
Archive for Mathematical Logic
2003-09-16Paper
The computational power of \({\mathcal M}^\omega\)
Mathematical Logic Quarterly (MLQ)
2002-09-16Paper
Exact real number computations relative to hereditarily total functionals.
Theoretical Computer Science
2002-07-31Paper
On choosing the correct model for computability over the reals
Normat
2002-04-17Paper
scientific article; zbMATH DE number 1722644 (Why is no real title available?)2002-03-21Paper
scientific article; zbMATH DE number 1390018 (Why is no real title available?)2001-07-22Paper
Computability over the partial continuous functionals
Journal of Symbolic Logic
2001-07-16Paper
scientific article; zbMATH DE number 1531372 (Why is no real title available?)2001-02-28Paper
scientific article; zbMATH DE number 1531371 (Why is no real title available?)2001-02-28Paper
Hyperfinite type structures
Journal of Symbolic Logic
2000-06-22Paper
scientific article; zbMATH DE number 1405582 (Why is no real title available?)2000-02-23Paper
Closing the gap between the continuous functionals and recursion in \(^3E\)
Archive for Mathematical Logic
1998-12-03Paper
Total objects in inductively defined types
Archive for Mathematical Logic
1997-12-10Paper
Hereditarily effective typestreams
Archive for Mathematical Logic
1997-10-30Paper
scientific article; zbMATH DE number 895270 (Why is no real title available?)1996-11-05Paper
scientific article; zbMATH DE number 841092 (Why is no real title available?)1996-02-04Paper
Interpreting higher computations as types with totality
Archive for Mathematical Logic
1994-11-06Paper
scientific article; zbMATH DE number 269331 (Why is no real title available?)1994-05-06Paper
scientific article; zbMATH DE number 218500 (Why is no real title available?)1993-06-29Paper
Embeddability of ptykes
Journal of Symbolic Logic
1993-04-01Paper
scientific article; zbMATH DE number 4114613 (Why is no real title available?)1989-01-01Paper
Set recursion and \(\Pi ^ 1_ 2\)-logic
Annals of Pure and Applied Logic
1985-01-01Paper
scientific article; zbMATH DE number 3946115 (Why is no real title available?)1985-01-01Paper
Effective cofinalities and admissibility in E-recursion
Fundamenta Mathematicae
1984-01-01Paper
The definability of E(α)
Journal of Symbolic Logic
1984-01-01Paper
scientific article; zbMATH DE number 3851054 (Why is no real title available?)1984-01-01Paper
Characterizing the continuous functionals
Journal of Symbolic Logic
1983-01-01Paper
R.E. degrees of continuous functionals
Archiv für Mathematische Logik und Grundlagenforschung
1983-01-01Paper
GENERAL TYPE-STRUCTURES OF CONTINUOUS AND COUNTABLE FUNCTIONALS
Mathematical Logic Quarterly
1983-01-01Paper
scientific article; zbMATH DE number 3916254 (Why is no real title available?)1982-01-01Paper
scientific article; zbMATH DE number 3786766 (Why is no real title available?)1982-01-01Paper
Countable functionals and the projective hierarchy
Journal of Symbolic Logic
1981-01-01Paper
The continuous functionals; computations, recursions and degrees
Annals of Mathematical Logic
1981-01-01Paper
Recursion on the countable functionals
Lecture Notes in Mathematics
1980-01-01Paper
scientific article; zbMATH DE number 3685472 (Why is no real title available?)1980-01-01Paper
The 1-section of a countable functional
Journal of Symbolic Logic
1980-01-01Paper
A Jump Operator in Set Recursion
Zeitschrift für Mathematische Logik und Grundlagen der Mathematik
1979-01-01Paper
Degrees of functionals
Annals of Mathematical Logic
1979-01-01Paper
scientific article; zbMATH DE number 3664930 (Why is no real title available?)1979-01-01Paper
A note on reflection.
MATHEMATICA SCANDINAVICA
1979-01-01Paper
scientific article; zbMATH DE number 3618128 (Why is no real title available?)1979-01-01Paper
A continuous functional with noncollapsing hierarchy
Journal of Symbolic Logic
1978-01-01Paper
Models for recursion theory
Journal of Symbolic Logic
1977-01-01Paper
Martin's axiom and medial functions.
MATHEMATICA SCANDINAVICA
1976-01-01Paper
On absolutely measurable sets
Fundamenta Mathematicae
1974-01-01Paper
On abstract 1-sections
Synthese
1974-01-01Paper
On some computational properties of open sets
(available as arXiv preprint)
N/APaper
On sequential theorems in Reverse Mathematics
(available as arXiv preprint)
N/APaper


Research outcomes over time


This page was built for person: Dag Normann