|
|||||||||||||||
|
For å registrere i Cristin må du være vitenskapelig eller administrativt ansatt.
|
|||||||||||||||
|
|||||||||||||||
|
|||||||||||||||
|
2024
|
||
| 1. | Normann, Dag. Computability and non-monotone induction. Computability - The Journal of the Assosiation 2024 UiO |
|
|
2023
|
||
| 2. | Normann, Dag. A higher order perspective on computational analysis. Twentieth International Conference on Computability and Complexity in Analysis; 2023-09-07 - 2023-09-09 UiO |
|
|
|
||
| 3. | Normann, Dag; Sanders, Sam. The Biggest Five of Reverse Mathematics. Journal of Mathematical Logic 2023 s. - UiO |
|
|
2022
|
||
| 4. | Normann, Dag. A recent development in the computability theory for functionals of type 3. Proof and Computation 2022; 2022-05-30 - 2022-06-02 UiO |
|
|
|
||
| 5. | Normann, Dag. The complexity of operators constructed in mainstream mathematics. Logic Seminar, Carnegie-Mellon University; 2022-02-15 - 2022-02-15 UiO |
|
|
|
||
| 6. | Normann, Dag. Typed lambda calculus and operators of mainstream mathematics. Seminar on the Foundation of Computer Science; 2022-05-03 - 2022-05-03 UiO |
|
|
|
||
| 7. | Normann, Dag; Sanders, Sam. Betwixed Turing and Kleene. Logical Foundation of Computer Science 2022 - Online; 2022-01-10 - 2022-01-13 UiO |
|
|
|
||
| 8. | Normann, Dag; Sanders, Sam. On Robust theorems due to Bolzano, Weierstrass, Jordan, and Cantor. Journal of Symbolic Logic (JSL) 2022 s. - UiO |
|
|
|
||
| 9. | Normann, Dag; Sanders, Sam. On the computational properties of basic mathematical notions. Journal of Logic and Computation 2022 ;Volum 32.(8) s. 1747-1795 UiO |
|
|
|
||
| 10. | Normann, Dag; Sanders, Sam. On the uncountability of R. Journal of Symbolic Logic (JSL) 2022 ;Volum 87.(4) s. 1-45 UiO |
|
|
2021
|
||
| 11. | Normann, Dag. An alternative perspective on Reverse Mathematics. Nordic Online Logic Seminars; 2021-06-21 - 2021-06-21 UiO |
|
|
|
||
| 12. | Normann, Dag; Sanders, Sam. Betwixt Turing and Kleene. Lecture Notes in Computer Science (LNCS) 2021 ;Volum 13137. s. 236-252 UiO |
|
|
|
||
| 13. | Normann, Dag; Sanders, Sam. The Axiom of Choice in computability theory and Reverse Mathematics with a cameo for the Continuum Hypothesis. Journal of Logic and Computation 2021 ;Volum 31.(1) s. 297-325 UiO |
|
|
2020
|
||
| 14. | Normann, Dag. Measure-theoretic Uniformity and the Suslin Functional. Computability - The Journal of the Assosiation 2020 ;Volum 10.(2) s. 91-105 UiO |
|
|
|
||
| 15. | Normann, Dag; Sanders, Sam. Open sets in computability theory and reverse mathematics. Journal of Logic and Computation 2020 ;Volum 30.(8) s. 1639-1679 UiO |
|
|
|
||
| 16. | Normann, Dag; Sanders, Sam. Pincherle's theorem in reverse mathematics and computability theory. Annals of Pure and Applied Logic 2020 ;Volum 171.(5) UiO |
|
|
2019
|
||
| 17. | Normann, Dag. The Computational Complexity of the Heine Borel Theorem. Homotopy Type Theory and Univalent Foundation; 2019-04-02 - 2019-04-02 UiO |
|
|
|
||
| 18. | Normann, Dag; Sanders, Sam. Computability Theory, Nonstandard Analysis, and Their Connections. Journal of Symbolic Logic (JSL) 2019 ;Volum 84.(4) s. 1422-1465 UiO |
|
|
|
||
| 19. | Normann, Dag; Sanders, Sam. The strength of compactness in Computability Theory and Nonstandard Analysis. Annals of Pure and Applied Logic 2019 ;Volum 170.(11) s. 1-42 UiO |
|
|
2018
|
||
| 20. | Normann, Dag. A comparative study of the Heine-Borel theorem, the Lindelöf Lemma and non-monotone inductive definitions of sets of integers. International Workshop on Computational Approaches to the Foundations of Mathematics; 2018-04-11 - 2018-04-13 UiO |
|
|
|
||
| 21. | Normann, Dag. David Marker, Lectures on Infinitary Model Theory. Studia Logica: An International Journal for Symbolic Logic 2018 s. - UiO |
|
|
|
||
| 22. | Normann, Dag. Functionals of Type 3 as Realisers of Classical Theorems in Analysis. I: Sailing Routes in the World of Computation. Springer Nature 2018 ISBN 978-3-319-94417-3. s. 318-327 UiO |
|
|
|
||
| 23. | Normann, Dag. Functionals of Type 3 as Realisers of Classical Theorems in Analysis. CiE 2018; 2018-07-30 - 2018-08-03 UiO |
|
|
|
||
| 24. | Normann, Dag. The sequential functionals of type $(\iota \rightarrow \iota)^n \rightarrow \iota$ form a dcpo for all $n \in {\mathbb N}$. Logical Methods in Computer Science 2018 ;Volum 14.(1) s. - UiO |
|
|
|
||
| 25. | Normann, Dag; Sanders, Sam. On the mathematical and foundational significance of the uncountable. Journal of Mathematical Logic 2018 ;Volum 18.(2) s. - UiO |
|
|
2017
|
||
| 26. | Normann, Dag; Tait, William. On the Computability of the Fan Functional. I: Feferman on Foundations Logic, Mathematics, Philosophy. Springer Nature 2017 ISBN 978-3-319-63332-9. s. 57-70 UiO |
|
|
2016
|
||
| 27. | Normann, Dag. On the Cantor-Bendixson rank of a set that is searchable in Gödel's T. Computability - The Journal of the Assosiation 2016 ;Volum 5.(1) s. 61-74 UiO |
|
|
|
||
| 28. | Normann, Dag. Revisiting Transfinite Types. PCC 2016; 2016-05-05 - 2016-05-06 UiO |
|
|
2015
|
||
| 29. | Longley, John; Normann, Dag. Higher-Order Computability. Springer 2015 (ISBN 978-3-662-47991-9) 585 s. Theory and Applications of Computability(3) UiO |
|
|
|
||
| 30. | Normann, Dag. Abels tårn. NRK [Radio] 2015-01-02 UiO |
|
|
|
||
| 31. | Normann, Dag. Alan Turing - mer enn en kodebryter. På slaget tolv; 2015-03-06 - 2015-03-06 UiO |
|
|
|
||
| 32. | Normann, Dag. The extensional realizability model of continuous functionals and three weakly non-constructive classical theorems. Logical Methods in Computer Science 2015 ;Volum 11.(1) s. - UiO |
|
|
|
||
| 33. | Normann, Dag. Var Turing oppfinneren av datamaskinen?. Den store skolekinodagen 2015; 2015-02-03 UiO |
|
|
2014
|
||
| 34. | Normann, Dag. Higher Generalizations of the Turing Model. I: Turing's Legacy: Developments from Turing's Ideas in Logic. Cambridge University Press 2014 ISBN 978-1-107-04348-0. s. 397-433 UiO |
|
|
2013
|
||
| 35. | Buss, Sam; Lowe, Benedikt; Normann, Dag; Soskov, Ivan. Computability in Europe 2011 Preface. Annals of Pure and Applied Logic 2013 ;Volum 164.(5) s. 509-510 UiO |
|
|
2012
|
||
| 36. | Normann, Dag. Internal or external, abstract or concrete? What does this mean for computing in a Banach space?. JVT 60; 2012-04-12 - 2012-04-12 UiO |
|
|
|
||
| 37. | Normann, Dag. Sequential vs. Continuous Functionals of Finite types. Seminar in Honor of Vladimir Sazonov; 2012-09-27 - 2012-09-27 UiO |
|
|
|
||
| 38. | Normann, Dag. The Continuous Functionals as Limit Spaces. I: Logic, Construction, Computation. Ontos Verlag 2012 ISBN 978-3-86838-158-0. s. 353-379 UiO |
|
|
|
||
| 39. | Normann, Dag; Sazonov, Vladimir Yu.. The extensional ordering of the sequential functionals. Annals of Pure and Applied Logic 2012 ;Volum 163.(5) s. 575-603 UiO |
|
|
2011
|
||
| 40. | Normann, Dag. Banach spaces as data types. Logical Methods in Computer Science 2011 ;Volum 7.(2) s. - UiO |
|
|
|
||
| 41. | Normann, Dag. Banach spaces as data types. Constructivity and computability in analysis; 2011-06-09 - 2011-06-10 UiO |
|
|
|
||
| 42. | Normann, Dag. Experiments on an Internal Approach to Typed Algorithms in Analysis. I: Computability in Context. Computation and Logic in the Real World. Imperial College Press 2011 ISBN 978-1-84816-245-7. s. 297-327 UiO |
|
|
|
||
| 43. | Normann, Dag. Fixed point computability of total functionals. Domains X; 2011-09-05 - 2011-09-07 UiO |
|
|
|
||
| 44. | Normann, Dag. Om Urysohns universelle metriske rom - og litt om Urysohn selv. Ski og Matematikk 2011; 2011-01-06 - 2011-01-09 UiO |
|
|
|
||
| 45. | Normann, Dag. Sequential versus Continuous Models of Finite Types. Types 2011; 2011-09-08 - 2011-09-11 UiO |
|
|
2009
|
||
| 46. | Normann, Dag. A rich hierarchy of functionals of finite types. Logical Methods in Computer Science 2009 ;Volum 5.(3) s. - UiO |
|
|
|
||
| 47. | Normann, Dag. Computations and functionals of finite types. Mal'sev 2009; 2009-08-24 - 2009-08-28 UiO |
|
|
|
||
| 48. | Normann, Dag. Continuous vs. Sequential Functionals - Harmony or Disharmony?. Leeds Logic Seminar; 2009-04-29 - 2009-04-29 UiO |
|
|
|
||
| 49. | Normann, Dag. Finite Sequential Procedures with Observational Ordering. Theory Seminar in Informatics, Birmingham; 2009-05-04 - 2009-05-04 UiO |
|
|
|
||
| 50. | Normann, Dag. Functionals of finite types - bridging logic and computer science. Computer Science Seminar, Liverpool; 2009-04-30 - 2009-04-30 UiO |
|