Viggo Stoltenberg-Hansen | Academic Influence

Viggo Stoltenberg-Hansen's AcademicInfluence.com Rankings

Viggo Stoltenberg-Hansen

Mathematics

#7737

World Rank

#10500

Historical Rank

Group Theory

#478

World Rank

#554

Historical Rank

Number Theory

#496

World Rank

#613

Historical Rank

Algebra

#773

World Rank

#1005

Historical Rank

mathematics Degrees

Download Badge

Mathematics

Viggo Stoltenberg-Hansen's Degrees

PhD Mathematics Uppsala University
Masters Mathematics Stockholm University
Bachelors Mathematics Stockholm University

Similar Degrees You Can Earn

Best Online Bachelor's in Math 2025

Why Is Viggo Stoltenberg-Hansen Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Viggo Stoltenberg-Hansen, born 1942, professor at Uppsala University, Department of Mathematics, is a Swedish mathematician/logician and expert on domain theory and recursion theory . Viggo received his PhD in Mathematics from University of Toronto in 1973.

(See a Problem?)

Viggo Stoltenberg-Hansen's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

In: Handbook of Logic in Computer Science (1995) (266)
Mathematical theory of domains (1994) (224)
Effective algebras (1995) (96)
Computable Rings and Fields (1999) (66)
Concrete Models of Computation for Topological Algebras (1999) (66)
Complete local rings as domains (1988) (55)
Domain Interpretations of Martin-Löf's Partial Type Theory (1990) (44)
Logicism, intuitionism, and formalism : what has become of them? (2009) (28)
Logicism, Intuitionism, and Formalism (2009) (26)
Geometry of interaction IV: the feedback equation (2006) (25)
Computable and continuous partial homomorphisms on metric partial algebras (2003) (20)
Algebraic and Fixed Point Equations over Inverse Limits of Algebras (1991) (18)
Domain representations of partial functions, with applications to spatial objects and constructive volume geometry (2002) (17)
Infinite Systems of Equations over Inverse Limits and Infinite Synchronous Concurrent Algorithms (1992) (16)
Finite alogorithmic procedures and computation theories. (1980) (15)
Finite alogorithmic procedures and inductive definability. (1980) (12)
Streams, Stream Transformers and Domain Representations (1998) (11)
Computability on Topological Spaces via Domain Representations (2008) (11)
Representability of Locally Compact Regular Spaces by Domains and Formal Spaces (1997) (7)
A Universal Domain (1994) (7)
Hyperfinite type structures (1999) (7)
Poincaré-Betti Series are Primitive Recursive (1985) (6)
Abstract versus concrete computability: the case of countable algebras (2016) (6)
Effective Domains and Concrete Computability: A survey (2000) (5)
Mathematical Theory of Domains: Power Domains (1994) (5)
Finite injury arguments in infinite computation theories (1979) (5)
Remarks on Martin-Löf's partial type theory (1992) (4)
Computing Roots of Unity in Fields (1980) (3)
Rank inequalities in the theory of differentially closed fields (2016) (3)
Logically presented domains (1995) (3)
Indestructibility and strong compactness (2016) (2)
Stability for Effective Algebras (2008) (2)
Consistency and games— in search of new combinatorial principles (2016) (2)
A logical presentation of the continuous functionals (1997) (2)
Mathematical Theory of Domains: Topology (1994) (2)
Stability of representations of effective partial algebras (2011) (2)
Weakly Inadmissible Recursion Theory (1978) (2)
Has the continuumhypothesis been settled (2016) (1)
Cartesian Closed Categories of Effective Domains (2002) (1)
Two categories of effective continuous cpos (2006) (1)
On local modularity in homogeneous structures (2016) (1)
A REGULAR SET THEOREM FOR INFINITE COMPUTATION THEORIES (1977) (1)
Logic Colloquium '03: Proceedings of the Annual European Summer Meeting of the Association for Symbolic Logic (2006) (1)
On computational complexity in weakly admissible structures (1980) (1)
He rose and jc Shepherdson (1999) (0)
C. TRETKOFF [1988] Complexity, combinatorial group theory and the language of palutators, Theoret. Comput. Sci., 56. pp. 253-275 (1999) (0)
Some applications of regularmarkers (2016) (0)
A Non-Adequate Admissible Set with a Good Degree-Structure (1978) (0)
Distributor:DepartmentofMathematics,Box480,S-75106Uppsala,Sweden PrintedinSwedenbyReprocentralenHSC,Uppsala1997 ToJessicaAcknowledgements (2011) (0)
Effective Cartesian Closed Categories of Domains (2001) (0)
7th Scandinavian Logic Symposium (1997) (0)
Definability and reducibility in higher types over the reals (2016) (0)
CAMBRIDGE The Uncertain Reasoner's Companion A Mathematical Perspective Metamathematics, Machines, and Godel's Proof (2009) (0)
Logic Colloquium '03: Lecture Notes in Logic 24 (2006) (0)
Generalizing finitemodel theory (2016) (0)
Mathematical Theory of Domains: Complete Partial Orders (1994) (0)
Cocovering and set forcing (2016) (0)
Mathematical Theory of Domains: Basic Recursion Theory (1994) (0)
Domains as Models of Formal Theories (1994) (0)
Mathematical Theory of Domains: Representability in Domains (1994) (0)
"Contributions to Pointfree Topology and Apartness Spaces" Uppsala Dissertations in Mathematics 71 (2011) (0)
Notes on Domain Theory ( Marktoberdorf 2001 ) (0)
The theory of is undecidable (2016) (0)
Computing roots of unity in fields : (preprint) (1979) (0)
Mathematical Theory of Domains: Representation Theory (1994) (0)

This paper list is powered by the following services:

Other Resources About Viggo Stoltenberg-Hansen

en.wikipedia.org

What Schools Are Affiliated With Viggo Stoltenberg-Hansen?

Viggo Stoltenberg-Hansen is affiliated with the following schools: