Dag Normann - RankMe

68 papers C 3Misc 1Journal 57Unranked 4

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	On sequential theorems in Reverse Mathematics. Arch. Math. Log. Dag Normann, Sam Sanders
2025	J	`jnl`	On some computational properties of open sets. J. Log. Comput. Dag Normann, Sam Sanders
2025	J	`jnl`	On the logical and computational properties of the Vitali covering theorem. Ann. Pure Appl. Log. Dag Normann, Sam Sanders
2025	J	`jnl`	The Biggest Five of Reverse Mathematics. J. Math. Log. Dag Normann, Sam Sanders
2024	J	`jnl`	Computability and non-monotone induction. Comput. Dag Normann
2024	J	`jnl`	On robust theorems due to Bolzano, Weierstrass, Jordan, and Cantor. J. Symb. Log. Dag Normann, Sam Sanders
2024	J	`jnl`	On some computational properties of open sets. CoRR Dag Normann, Sam Sanders
2022	Misc	`conf`	Betwixt Turing and Kleene. LFCS Dag Normann, Sam Sanders
2022	J	`jnl`	On the Uncountability of ℝ R. J. Symb. Log. Dag Normann, Sam Sanders
2022	J	`jnl`	On the computational properties of basic mathematical notions. CoRR Dag Normann, Sam Sanders
2022	J	`jnl`	On the computational properties of basic mathematical notions. J. Log. Comput. Dag Normann, Sam Sanders
2021	J	`jnl`	Betwixt Turing and Kleene. CoRR Dag Normann, Sam Sanders
2021	J	`jnl`	Measure-theoretic uniformity and the Suslin functional. Comput. Dag Normann
2021	J	`jnl`	The Axiom of Choice in computability theory and Reverse Mathematics with a cameo for the Continuum Hypothesis. J. Log. Comput. Dag Normann, Sam Sanders
2020	J	`jnl`	Open sets in computability theory and reverse mathematics. J. Log. Comput. Dag Normann, Sam Sanders
2020	J	`jnl`	Pincherle's theorem in reverse mathematics and computability theory. Ann. Pure Appl. Log. Dag Normann, Sam Sanders
2019	J	`jnl`	Computability Theory, Nonstandard Analysis, and their Connections. J. Symb. Log. Dag Normann, Sam Sanders
2019	J	`jnl`	On the mathematical and foundational significance of the uncountable. J. Math. Log. Dag Normann, Sam Sanders
2019	J	`jnl`	The strength of compactness in Computability Theory and Nonstandard Analysis. Ann. Pure Appl. Log. Dag Normann, Sam Sanders
2018	J	`jnl`	David Marker, Lectures on Infinitary Model Theory - Series: Lecture Notes in Logic, Vol. 46 2016, pp. 192. ISBN-13: 978-1107181939. Stud Logica Dag Normann
2018	C	`conf`	Functionals of Type 3 as Realisers of Classical Theorems in Analysis. CiE Dag Normann
2018	J	`jnl`	S. Barry Cooper (1943-2015). Comput. 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
2018	J	`jnl`	The sequential functionals of type (ι→ι) Log. Methods Comput. Sci. Dag Normann
2016	J	`jnl`	On the Cantor-Bendixson rank of a set that is searchable in Gödel's T. Comput. Dag Normann
2016	J	`jnl`	The sequential functionals of type (ι→ι) CoRR Dag Normann
2015	—	`book`	Higher-Order Computability John Longley, Dag Normann
2015	J	`jnl`	The extensional realizability model of continuous functionals and three weakly non-constructive classical theorems. Log. Methods Comput. Sci. Dag Normann
2014	—	`ch.`	Higher generalizations of the Turing Model. Turing's Legacy Dag Normann
2013	J	`jnl`	Computability in Europe 2011. Ann. Pure Appl. Log. Sam Buss, Benedikt Löwe, Dag Normann, Ivan N. Soskov
2012	J	`jnl`	The extensional ordering of the sequential functionals. Ann. Pure Appl. Log. Dag Normann, Vladimir Yu. Sazonov
2011	J	`jnl`	Banach Spaces as Data Types Log. Methods Comput. Sci. Dag Normann
2011	C	`ed.`	Models of Computation in Context - 7th Conference on Computability in Europe, CiE 2011, Sofia, Bulgaria, June 27 - July 2, 2011. Proceedings CiE Benedikt Löwe, Dag Normann, Ivan N. Soskov, Alexandra A. Soskova
2009	J	`jnl`	A rich hierarchy of functionals of finite types Log. Methods Comput. Sci. Dag Normann
2008	C	`conf`	Internal Density Theorems for Hierarchies of Continuous Functionals. CiE Dag Normann
2007	J	`jnl`	Logical Approaches to Computational Barriers: CiE 2006. J. Log. Comput. Arnold Beckmann, Benedikt Löwe, Dag Normann
2006	J	`jnl`	Computing with functionals - computability theory or computer science? Bull. Symb. Log. Dag Normann
2006	J	`jnl`	Mathematics of computing at CiE 2005. Math. Struct. Comput. Sci. S. Barry Cooper, Benedikt Löwe, Dag Normann
2006	J	`jnl`	On sequential functionals of type 3. Math. Struct. Comput. Sci. Dag Normann
2005	J	`jnl`	Comparing hierarchies of total functionals CoRR Dag Normann
2005	J	`jnl`	Comparing hierarchies of total functionals. Log. Methods Comput. Sci. Dag Normann
2004	J	`jnl`	Hierarchies of total functionals over the reals. Theor. Comput. Sci. Dag Normann
2002	—	`conf`	A Nonstandard Characterisation of the Type-structure of Continuous Functionals Over the Reals. Workshop on Domains Dag Normann
2002	J	`jnl`	Continuity, proof systems and the theory of transfinite computations. Arch. Math. Log. Dag Normann
2002	J	`jnl`	Exact real number computations relative to hereditarily total functionals. Theor. Comput. Sci. Dag Normann
2002	J	`jnl`	Limit spaces and transfinite types. Arch. Math. Log. Dag Normann, Geir Waagbø
2002	J	`jnl`	Representation theorems for transfinite computability and definability. Arch. Math. Log. Dag Normann
2002	J	`jnl`	The Computational Power of Math. Log. Q. Dag Normann, Christian Rordam
2001	—	`conf`	Definability of Total Objects in PCF and Related Calculi. TLCA Dag Normann
2000	J	`jnl`	Computability over The Partial Continuous Functionals. J. Symb. Log. Dag Normann
1999	J	`jnl`	Hyperfinite Type Structures. J. Symb. Log. Dag Normann, Erik Palmgren, Viggo Stoltenberg-Hansen
1999	—	`ch.`	The Continuous Functionals. Handbook of Computability Theory Dag Normann
1998	—	`conf`	The Cook-Berger problem - A guide to the solution. Workshop on Domains Dag Normann
1998	—	`conf`	The continuous functionals of finite types over the reals. Workshop on Domains Dag Normann
1997	J	`jnl`	Closing the gap between the continuous functionals and recursion in Arch. Math. Log. Dag Normann
1997	J	`jnl`	Hereditarily effective typestreams. Arch. Math. Log. Dag Normann
1997	J	`jnl`	Total objects in inductively defined types. Arch. Math. Log. Lill Kristiansen, Dag Normann
1994	J	`jnl`	Interpreting higher computations as types with totality. Arch. Math. Log. Lill Kristiansen, Dag Normann
1992	J	`jnl`	Embeddability of PTYKES. J. Symb. Log. Jean-Yves Girard, Dag Normann
1985	J	`jnl`	Set recursion and Πhalf-logic. Ann. Pure Appl. Log. Jean-Yves Girard, Dag Normann
1984	J	`jnl`	The Definability of E(alpha). J. Symb. Log. Edward R. Griffor, Dag Normann
1983	J	`jnl`	Characterizing the Continuous Functionals. J. Symb. Log. Dag Normann
1983	J	`jnl`	General Type-Structures of Continuous and Countable Functionals. Math. Log. Q. Dag Normann
1983	J	`jnl`	R.E. degrees of continuous functionals. Arch. Math. Log. Dag Normann
1981	J	`jnl`	Countable Functionals and the Projective Hierarchy. J. Symb. Log. Dag Normann
1980	J	`jnl`	The 1-Section of a Countable Functional. J. Symb. Log. Dag Normann, Stanley S. Wainer
1979	J	`jnl`	A Jump Operator in Set Recursion. Math. Log. Q. Dag Normann
1978	J	`jnl`	A Continuous Functional with Noncollapsing Hierarchy. J. Symb. Log. Dag Normann
1976	J	`jnl`	Models for Recursion Theory. J. Symb. Log. Johan Moldestad, Dag Normann