Библиография Лаврова И.А.

Normann D. [1979] Degrees of functionals Ann. Math. Logic, 16, № 3, 269-304 80.05.52 article Вернуться к поиску

Normann D. [1978] The continuos functional with noncollapsing hierarchy J. Symbolic Logic, 43, № 3, 487-491 79.06.71 article Вернуться к поиску

Normann D. [1983] Characterizing the continuons functionals J. Symbolic Logic, 48, № 4, 965-969 84.08.51 article Вернуться к поиску

Normann D. [1999] The continuons functionals Handbook of Computability Theory, Elsevier, 251-275 ? article Вернуться к поиску

Normann D. [2006] Computing with functionals – computable theory or computer science Bull. Symbolic Logic, 12, № 1, 43-59 ? article Вернуться к поиску

Normann D. [2000] Computability over the partial continuons functionals J. Symbolic Logic, 65, № 3, 1133-1142 07.01.75 article Вернуться к поиску

Normann D. [1997] Hereditarily effective typestreams Arch. Math. Logik Grundl., 36, № 3, 219-225 01.12.100 article Вернуться к поиску

Normann D. [1979] Recursion in 3 E and a splitting theorem Essays on Math., Phil. Logic, D.Reidel Publ. Com., 275-286 ? article Вернуться к поиску

Normann D. [1980] Recursion on countable functionals Lect. Notes in Math., 811, Springer-Verlag 81.02.28 SO book Вернуться к поиску

Normann D. [1979] A classification of higher type functionals Proc. 5 Scand. Logic Symp., Aalborg Univ. Press, 301-308 ? article Вернуться к поиску

Normann D. [1981] Countable functionals and the projective hierarchy J. Symbolic Logic, 46, № 2, 209-215 82.01.39 article Вернуться к поиску

Normann D. [1979] A jump-operator in set recursion Z. math. Logik und Grundl. Math., 25, № 3, 251-264 80.02.33 article Вернуться к поиску

Normann D. [1974] On abstract 1-sections Synthese, 27, 254-263 ? article Вернуться к поиску

Normann D., Wainer S. S. [1980] The 1-section of a countable functional J. Symbolic Logic, 45, № 3, 549-562 81.05.56 article Вернуться к поиску

Normann D., Palmgren E., Stoltenberg-Hansen V. [1999] Hyperfinite type structures J. Symbolic Logic, 64, № 3, 1216-1242 02.04.65 article Вернуться к поиску

Moldestad J., Normann D. [1976] Models for recursion theory J. Symbolic Logic, 41, № 4, 719-729 77.11.89 article Вернуться к поиску

Normann D. [1982] Non-obtainable continuous functionals Proc VI Inter. Congress Logic, Methdology, Philosophy Sci., (Hannover, 1979), North-Holland, 241-249 ? article Вернуться к поиску

Normann D. [1981] The continuons functionals: computations, recursions and degrees Ann. Math. Logic, 21, № 1, 1-26 82.08.53 O article Вернуться к поиску

Moldestad J., Normann D. [1977] Gap-phenomena in higher type recursion theory Lect. Notes in Math., 574, 109-149, Springer-Verlag ? article Вернуться к поиску

Normann D. [1978] Set recursion General Recursion Theory, II, Proc. Symp. (Oslo, 1977), 303-320,North Holland 79.05.64 article Вернуться к поиску

Normann D. [1983] Recursively enumerable degrees of continuous functionals Arch. Math. Logik Grundl., 23, № 1-2, 79-98 84.02.48 article Вернуться к поиску

Normann D. [2002] Representation theorems for transfinite computability and definability Arch. Math. Logik Grundl., 41, № 8, 721-741 04.12.81 article Вернуться к поиску

Normann D. [2002] Exact real number compatation relative to hereditarily total functions Theor. Comp. Sci., 284, № 2, 437-453 04. ВН1.167 article Вернуться к поиску

Normann D. [1983] General type-structures of continuous and countable functionals Z. math. Logik und Grundl. Math., 29, № 2, 177-192 84.02.47 article Вернуться к поиску

Normann D. [1997] Closing the gap between the continuons functionals and recursion in 3 E Arch. Math. Logik Grundl., 36, № 3-4, 269-287 ? article Вернуться к поиску

Kristiansen L. Normann D. [1997] Total objects in inductively defined types Arch. Math. Logik Grundl., 36, № 6, 405-436 01.12.134 article Вернуться к поиску

Normann D. [1996] A hierarchy of domains with totality, but without density London Math. Soc. Lect. Notes, Cambridge Univ. Press, 224, 233-257 ? article Вернуться к поиску

Normann D. [2002] Continuity, proof systems and the theory of transfinite computations Arch. Math. Logik Grundl., 41, № 8, 765-788 04.12.80 article Вернуться к поиску

Kristiansen L. Normann D. [1994] Interpreting higher computations as types with totality Arch. Math. Logik Grundl., 33, № 4, 243-259 95.07.44 article Вернуться к поиску

Normann D. [1980] The recursion theory of the continuos functionals London Math. Soc. Lect. Notes, Cambridge Univ. Press, 45, 171-183 81.03.45 S article Вернуться к поиску

Normann D. [1982] External and internal algorithms on the continuous functionals Proc. Patras Logic Symp. (Patras, Greece, 1980), North-Holland, 137-144 84.02.38 article Вернуться к поиску

Normann D., Stoltenberg-Hansen V. [1978] A non-adequate admissible set with good degree structure General Recursion Theory, II, Proc. Symp. (Oslo, 1977), 321-329, North- Holland 79.08.39 article Вернуться к поиску

Normann D. [1985] Aspects of the continuons functionals Proc. Summer Institute on Recursive Theory (Ithaca, New York), 42, Amer. Math. Soc., Ass. Symbolic Logic,171-176 86.03.43 article Вернуться к поиску

Normann D. [2006] On sequential functionals of type 3 Math. Struct. Comput. Sci.: A Jour. in the Appl. of Categorical, Algebraic and Geometric Methods in Comput. Sci., 16, № 2, 279-289 06.11.142 article Вернуться к поиску

N Nadel M.E. Neis H.C. Nelson G.C. Nerode A. Nessel J. Ng Keng Meng Nies A. Nikolova S.K. Normann D. Вернуться на главную страницу