V. Stoltenberg-Hansen

722 total citations
26 papers, 368 citations indexed

About

V. Stoltenberg-Hansen is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Geometry and Topology. According to data from OpenAlex, V. Stoltenberg-Hansen has authored 26 papers receiving a total of 368 indexed citations (citations by other indexed papers that have themselves been cited), including 15 papers in Computational Theory and Mathematics, 11 papers in Artificial Intelligence and 7 papers in Geometry and Topology. Recurrent topics in V. Stoltenberg-Hansen's work include Computability, Logic, AI Algorithms (11 papers), Logic, programming, and type systems (10 papers) and Logic, Reasoning, and Knowledge (8 papers). V. Stoltenberg-Hansen is often cited by papers focused on Computability, Logic, AI Algorithms (11 papers), Logic, programming, and type systems (10 papers) and Logic, Reasoning, and Knowledge (8 papers). V. Stoltenberg-Hansen collaborates with scholars based in Sweden, United Kingdom and Norway. V. Stoltenberg-Hansen's co-authors include John V. Tucker, Erik Palmgren, Krister Segerberg, Sten Lindström and Dag Normann and has published in prestigious journals such as Theoretical Computer Science, Bulletin of the London Mathematical Society and Journal of the London Mathematical Society.

In The Last Decade

V. Stoltenberg-Hansen

22 papers receiving 319 citations

Peers

V. Stoltenberg-Hansen

CTM

AI

MP

GT

CNC

Jacques Sakarovitch France

Marc Bezem Norway

J. I. Zucker Canada

J. M. E. Hyland United Kingdom

Andrej Bauer Slovenia

Stefano Varricchio Italy

Jerome Malitz United States

Kevin J. Compton United States

Alan R. Woods Australia

David Gillman United States

Jacques Sakarovitch France

V. Stoltenberg-Hansen

473 ×1.7

CTM

334 ×1.4

AI

54 ×0.9

MP

77 ×1.3

GT

20 ×0.5

CNC

Citations per year, relative to V. Stoltenberg-Hansen V. Stoltenberg-Hansen (= 1×) peers Jacques Sakarovitch

Countries citing papers authored by V. Stoltenberg-Hansen

Since Specialization

Citations

This map shows the geographic impact of V. Stoltenberg-Hansen's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by V. Stoltenberg-Hansen with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites V. Stoltenberg-Hansen more than expected).

Fields of papers citing papers by V. Stoltenberg-Hansen

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by V. Stoltenberg-Hansen. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by V. Stoltenberg-Hansen. The network helps show where V. Stoltenberg-Hansen may publish in the future.

Co-authorship network of co-authors of V. Stoltenberg-Hansen

This figure shows the co-authorship network connecting the top 25 collaborators of V. Stoltenberg-Hansen. A scholar is included among the top collaborators of V. Stoltenberg-Hansen based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with V. Stoltenberg-Hansen. V. Stoltenberg-Hansen is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

1.

Stoltenberg-Hansen, V., et al.. (2011). Stability of representations of effective partial algebras. Mathematical logic quarterly. 57(2). 217–231. 2 indexed citations

2.

Lindström, Sten, Erik Palmgren, Krister Segerberg, & V. Stoltenberg-Hansen. (2009). Logicism, intuitionism, and formalism : what has become of them?. Springer eBooks. 10 indexed citations

3.

Stoltenberg-Hansen, V., et al.. (2008). Stability for Effective Algebras. Electronic Notes in Theoretical Computer Science. 221. 3–15. 1 indexed citations

4.

Stoltenberg-Hansen, V., et al.. (2006). Two categories of effective continuous cpos. Theoretical Computer Science. 365(3). 216–236.

5.

Stoltenberg-Hansen, V. & John V. Tucker. (2003). Computable and Continuous Partial Homomorphisms on Metric Partial Algebras. Bulletin of Symbolic Logic. 9(3). 299–334. 11 indexed citations

6.

Stoltenberg-Hansen, V., et al.. (2002). Domain representations of partial functions, with applications to spatial objects and constructive volume geometry. Theoretical Computer Science. 284(2). 207–240. 7 indexed citations

7.

Stoltenberg-Hansen, V.. (2000). Effective Domains and Concrete Computability: A survey. 2 indexed citations

8.

Stoltenberg-Hansen, V. & John V. Tucker. (1999). Concrete models of computation for topological algebras. Theoretical Computer Science. 219(1-2). 347–378. 34 indexed citations

9.

Stoltenberg-Hansen, V., et al.. (1997). Representability of locally compact regular spaces by domains and formal spaces. Theoretical Computer Science. 179(1-2). 319–331. 5 indexed citations

10.

Stoltenberg-Hansen, V.. (1997). 7th Scandinavian Logic Symposium. Bulletin of Symbolic Logic. 3(4). 487–488. 1 indexed citations

11.

Palmgren, Erik & V. Stoltenberg-Hansen. (1997). A logical presentation of the continuous functionals. Journal of Symbolic Logic. 62(3). 1021–1034. 2 indexed citations

12.

Stoltenberg-Hansen, V. & John V. Tucker. (1995). Effective algebras. 357–526. 33 indexed citations

13.

Palmgren, Erik & V. Stoltenberg-Hansen. (1992). Remarks on Martin-Löf's partial type theory. BIT Numerical Mathematics. 32(1). 70–83. 2 indexed citations

14.

Stoltenberg-Hansen, V. & John V. Tucker. (1991). Algebraic and fixed point equations over inverse limits of algebras. Theoretical Computer Science. 87(1). 1–24. 14 indexed citations

15.

Palmgren, Erik & V. Stoltenberg-Hansen. (1990). Domain interpretations of martin-löf’s partial type theory. Annals of Pure and Applied Logic. 48(2). 135–196. 23 indexed citations

16.

Stoltenberg-Hansen, V. & John V. Tucker. (1988). Complete local rings as domains. Journal of Symbolic Logic. 53(2). 603–624. 30 indexed citations

17.

Stoltenberg-Hansen, V.. (1980). On computational complexity in weakly admissible structures. Journal of Symbolic Logic. 45(2). 353–358.

18.

Stoltenberg-Hansen, V., et al.. (1980). Finite alogorithmic procedures and inductive definability.. MATHEMATICA SCANDINAVICA. 46. 62–62. 1 indexed citations

19.

Stoltenberg-Hansen, V., et al.. (1980). Finite alogorithmic procedures and computation theories.. MATHEMATICA SCANDINAVICA. 46. 77–77. 5 indexed citations

20.

Stoltenberg-Hansen, V.. (1979). Finite injury arguments in infinite computation theories. Annals of Mathematical Logic. 16(1). 57–80. 2 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact