Viggo Stoltenberg-Hansen

From Wikipedia, the free encyclopedia

Viggo Stoltenberg-Hansen, professor at Uppsala University, Department of Mathematics, is a Swedish mathematician/logician and expert on domain theory and recursion theory (also known as computability theory). Viggo received his PhD in Mathematics (titled "On Priority Arguments In Friedberg Theories") from University of Toronto in 1973, supervised by Douglas Clarke.

One of his PhD students is Erik Palmgren, now himself also a professor in mathematical logic at Uppsala University, with a wide range of contributions in mathematical logic, domain theory, type theory, and topos theory. Another is Jens Blanck, known for his thesis which developed a theory for domain representations of metric spaces, an area to which Viggo himself has contributed.

Contents

[edit] Biography

Not known.

[edit] Work on recursion theory

Not known.

[edit] Work on domain theory

Research contributions not listed here yet.

Viggo Stoltenberg-Hansen and John Tucker developed in the early 1980s a general method of domain representations of topological algebras.

Viggo is the main author of the textbook "Mathematical Theory of Domains", Cambridge University Press, 1994 (coauthored by I. Lindström and E. Griffor), and also of a set of Marktoberdorf summer school lecture notes on domain theory.

[edit] Work on effective domains

Viggo Stoltenberg-Hansen and John Tucker made a thorough analysis of the computability associated to effective algebras and continuity of homomorphisms between such.

Further topics not known.

[edit] References

  1. V Stoltenberg-Hansen and J V Tucker, Effective algebras, in S Abramsky, D Gabbay and T Maibaum (eds.), Handbook of Logic in Computer Science, Volume IV: Semantic Modelling, Oxford University Press (1995), pp357-526.
  2. V Stoltenberg-Hansen and J V Tucker, Computable rings and fields, in E Griffor (ed.), Handbook of Computability Theory, Elsevier (1999), pp363-447.

[edit] External links

Not known.