Bibliography, Dag Normann

Bibliography, Dag Normann 1974 1. With J. E. Fenstad On absolutely measurable sets Fundamentha Mathematica 81 pp. 91-98 2. On abstract 1-sections Syn...
Author: Edith Butler
0 downloads 2 Views 105KB Size
Bibliography, Dag Normann 1974 1. With J. E. Fenstad On absolutely measurable sets Fundamentha Mathematica 81 pp. 91-98 2.

On abstract 1-sections Synthese 27 pp. 254-263

1976 3. With J. Moldestad Models for recursion theory Journal of symb. logic ( JSL ) 41 pp. 719-729 4.

Martin's axiom and medial functions Math. Scand. 38 pp. 167-176

1977 5. With J. Moldestad Gap-phenomena in higher type recursion theory In J. Moldestad: Computations in higher types Springer Lecture Notes in Mathematics 574 pp. 109-149 1978 6. A contionuous functional with noncollapsing hierarchy JSL 43 pp. 487-491 7.

Set recursion In Fenstad & al.: Generalized Recursion Theory II North Holland, pp. 303-320

8.

With V. Stoltenberg-Hansen A nonadequate admissible set with a good degreestructure In Fenstad & al.: Generalized Recursion Theory II North Holland, pp. 321-329

1979 9. Degrees og functionals Annals of Math. Logic 16 pp. 269-304 10. Recursion in 3E and a splitting theorem In Hintikka & al.: Essays on Mathematical and Philosophical logic D. Reidell pp. 275-285

11. A jump-operator in set recursion Zeitsch. f. Math. Log. u. Grundl. d. Math 25 pp. 251-264 12. A classification of higher type functionals In Jensen & al. Proceedings from 5th Scandinavian Logic Symposium Aalborg University Press pp. 301-308 13. A note on reflection Math Scand. 45 pp. 5-12 14. Lectures on Set Recursion, Proceedings C.I.M.E. Summer School on Recursion Theory, Bressanone Italia 1980 15. With S. S. Wainer The one-section of a countable functional JSL 45 pp. 549-562 16. Recursion on the countable functionals Springer Lecture Notes in Mathematics 811 17. The recursion theory of the continuous functionals In Drake and Wainer: Recursion theory: Its generalisations and applications Cambridge University Press, pp. 171-181 1981 18. Countable functionals and the projective hierarchy JSL 46 pp. 209-215 19. The continuous functionals; computations, recursions and degrees Annals of Math. Log. 21 pp. 1-26 1982 20. Non-obtainable continuous functionals In Logic, Methodology and Philosophy of science VI. Proceedings of the sixth International Congress og Logic, Methodology and Philosophy of Science, Hannover 1979, pp. 241-249 21. External and internal algorithms on the continuous functionals In Metakides: Patras Logic Symposium North Holland pp. 137-144 1983 22. R. e. degrees of continuous functionals Arch. math. Logik 23 pp.79-98

23. General type-structures of continuous and countable functionals Zeitsch. f. Math. Log. u. Grundl. d. Math. 29 pp. 177-192 24. Characterizing the continuous functionals JSL 48 pp. 965-969 25. With J.E. Fenstad Algorithms and Logic, Kompendium for MA 130 26. MA 350-Fast Innhold 1984 27. With E. R. Griffor The definability of E(α) JSL 49 pp. 437-442 28. Det uendelige - en matematisk nødvendighet Normat 32 pp. 63-70 1985 29. Aspects of the continuous functionals Proceedings of Symposia in Pure Mathematics 42 AMS pp. 171-176 30. With G.-Y. Girard Set-recursion and Π12-logic Ann. of Pure and Aplied Logic 28 pp 255-286 1986 31. Matematiske grunnlagsspørsmål. Undervisningsmateriell i MA 115 1988 32. With J. E. Fenstad Innføring i logikk Lecture Notes, Institute of Mathematics, Oslo 1989 33. Kleene-spaces In Ferro & al. Logic Colloquium '88 Elsevier, pp. 91-109 1990 34. Formalizing the notion of total information In Petkov: Mathematical Logic Plenum Press, pp. 67-94

1992 35. With J.-Y. Girard Embeddability of ptykes JSL 57 pp 659-676 36. Om induksjon, rekursjon og induksjonsbevis. Undervisningsmateriell til etterutdanningskurs i matematikk 1993 37. Langt, og lenger enn langt. Om transfinitt induksjon Normat 41 pp 60 - 65 1994 38. With L. Kristiansen Interpreting higher computations as types with totality Archive for mathematical logic 33 pp 243 - 259 1995 39. With L. Kristiansen Semantics for some constructors of type theory Behara, Fritsch and Lintz (eds.), Symposia Gaussiana, Conf. A Walter de Gruyter & Co, pp 201 - 224 1996 40. A hierarchy of Domains with totality, but without density Cooper, Slaman and Wainer (eds.), Computability, Enumerability, Unsolvability Cambridge University Press, pp233 - 257 1997 41. Closing the gap between the continuous functionals and recursion in 3E Archives for Mathematical logic 36, pp. 269-287 42. With L. Kristiansen Total objects in inductively defined types Archives for Mathematical Logic 36, pp. 405-436 43. Hereditarily effective typestreams Archives for Mathematical Logic 36, pp. 219-225 44. Recursion Theory Notes to Copenhagen Summer School in Logic. 1999 45. A Mahlo-universe of effective domains with totality. In Cooper and Truss (eds) Models and Computability, Proceedings from Logic Colloquium '97, pp. 293 - 312.

46. The continuous functionals iI E.R. Griffor (editor) Handbook of Computability Theory, Elsevier, pp. 251 -275 47. With E. Palmgren and V. Stoltenberg-Hansen Hyperfinite Type Structures Journal of Symbolic Logic (64) pp. 1216 - 1242 2000 48. The Cook-Berger Problem A Guide to the Solution In Spreen, Schultz and Greb (editors) Proceedings of the Workshop on Domains IV, Informatik-Berichte, University of Siegen. An extended version is accepted for the printed edition 49. Computability over the partial continuous functionals Journal of Symbolic Logic (65) pp. 1133 - 1142, 2001 50. The continuous functionals of finite types over the reals. In K. Keimel, G.Q.Zhang, Y. Liu and Y. Chen (eds.) Domains and Processes, pp. 103 – 124, Kluwer Academic Publishers 2002 51. With G. Waagbø Limit Spaces and Transfinite Types. Archives for Mathematical Logic 41, pp. 525 - 539 52. With Christian Rørdam The computational power of M^omega Mathematical Logic Quarterly 48 pp. 117 - 124 53. Continuity, proof systems and the theory of transfinite computations. Archives for Mathematical Logic 41, pp. 765 - 788 54. Representation theorems for transfinite computability and definability. Archives for Mathematical Logic 41, pp. 721 - 741 55. Exact real number computations relative to hereditarily total functionals. Theoretical Computer Science 284, pp.437 – 453 56. Om å velge den rette modell for beregnbarhet av de reelle tallene. NORMAT 49, pp 97 – 104

2004 57. A Nonstandard Characterization of the Type-structure of Continuous Functionals over the Reals. Electronical Notes in Theoretical Computer Science 73, pp 141 – 147 58. Hierarchies of total functionals over the reals. Theoretical Computer Science 316, pp 137 – 151 2005 59. Om mulige og tilsynelatende umulige programmeringsoppgaver. NORMAT 53, pp 21 – 27 60. Comparing hierarchies of total functionals Logical Methods in Computer Science Volume 1 (2) 2006 61. On sequential functionals of type 3. Mathematical Structures in Computer Science, 16, pp. 279-289 62. Computing with functionals- computability theory or computer science? Bulletin of Symbolic Logic 12, pp. 43-59. 63. Definability and reducibility in higher types over the reals. In V. Stoltenberg-Hansen and J. Väänänen (eds) Logic Colloquium ’03, Lecture Notes in Logic, ASL, pp. 200-220. 2008 64. Applications of the Kleene-Kreisel Density Theorem to Theoretical Computer Science. I: New Computational Paradigms; Changing Conceptions of What is Computable. Springer Publishing Company 2008. ISBN 978-0-387-36033-1. s. 119138 65. Internal Density Theorems for Hierarchies of Continuous Functionals. In A. Beckmann, C. Dimitracopoulos and B. Löwe (eds.) CiE 2008, LNCS 5028. pp. 467 – 475. 2009 66. A rich hierarchy of functionals of finite types. Logical Methods in Computer Science Volume 5 (3) In preparation With V. Yu. Sazonov The extensial ordering of the sequential functionals Invited to a special issue of Annals of Pure and Applied Logic.

With J. R. Longley The Computability Theory of Functionals of Finite Types To be published in the forthcomming CiE-book series “Computability” by Springer Verlag. Unpublished but cited papers of some significance With B. Birkeland A nonstandard treatment of the equation y' = f( y , t ) Oslo preprint 1980 With E. R. Griffor Effective cofinalities and admissibility in E-recursion Oslo preprint 1982 The recursion theory of ptykes Oslo preprint 1984 Inductively and recursively defined types Seminar report Categories of domains with totality Oslo Preprint in Mathematics no. 4 (1997)