Thomas Streicher

1.3k total citations
53 papers, 394 citations indexed

About

Thomas Streicher is a scholar working on Artificial Intelligence, Computational Theory and Mathematics and Geometry and Topology. According to data from OpenAlex, Thomas Streicher has authored 53 papers receiving a total of 394 indexed citations (citations by other indexed papers that have themselves been cited), including 39 papers in Artificial Intelligence, 35 papers in Computational Theory and Mathematics and 11 papers in Geometry and Topology. Recurrent topics in Thomas Streicher's work include Logic, programming, and type systems (35 papers), Logic, Reasoning, and Knowledge (32 papers) and Computability, Logic, AI Algorithms (14 papers). Thomas Streicher is often cited by papers focused on Logic, programming, and type systems (35 papers), Logic, Reasoning, and Knowledge (32 papers) and Computability, Logic, AI Algorithms (14 papers). Thomas Streicher collaborates with scholars based in Germany, United Kingdom and United States. Thomas Streicher's co-authors include Bernhard Reus, Martin Hofmann, Martı́n Hötzel Escardó, Martin Hofmann, Yves Lafont, Ulrich Kohlenbach, Martin Hofmann, Steve Awodey, Gary Gruenhage and Alex Simpson and has published in prestigious journals such as Advances in Mathematics, Theoretical Computer Science and Information and Computation.

In The Last Decade

Thomas Streicher

47 papers receiving 358 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Thomas Streicher Germany 12 331 278 72 55 23 53 394
Andrej Bauer Slovenia 10 187 0.6× 202 0.7× 45 0.6× 52 0.9× 17 0.7× 41 277
Paul-André Melliès France 11 377 1.1× 269 1.0× 40 0.6× 28 0.5× 43 1.9× 35 416
Ulrich Berger United Kingdom 13 398 1.2× 333 1.2× 21 0.3× 24 0.4× 35 1.5× 42 453
Martin Hyland United Kingdom 16 542 1.6× 382 1.4× 134 1.9× 101 1.8× 52 2.3× 28 627
Laurent Régnier France 11 444 1.3× 350 1.3× 44 0.6× 33 0.6× 38 1.7× 15 482
Kent Petersson Sweden 5 349 1.1× 230 0.8× 30 0.4× 19 0.3× 41 1.8× 7 375
Stefan Milius Germany 11 446 1.3× 289 1.0× 171 2.4× 45 0.8× 20 0.9× 78 484
Dag Normann Norway 10 203 0.6× 248 0.9× 82 1.1× 94 1.7× 16 0.7× 54 308
Bengt Nordström Sweden 6 411 1.2× 280 1.0× 30 0.4× 20 0.4× 45 2.0× 14 441
Giuseppe Rosolini Italy 13 324 1.0× 237 0.9× 142 2.0× 78 1.4× 36 1.6× 35 417

Countries citing papers authored by Thomas Streicher

Since Specialization
Citations

This map shows the geographic impact of Thomas Streicher'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 Thomas Streicher with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Thomas Streicher more than expected).

Fields of papers citing papers by Thomas Streicher

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Thomas Streicher. 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 Thomas Streicher. The network helps show where Thomas Streicher may publish in the future.

Co-authorship network of co-authors of Thomas Streicher

This figure shows the co-authorship network connecting the top 25 collaborators of Thomas Streicher. A scholar is included among the top collaborators of Thomas Streicher 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 Thomas Streicher. Thomas Streicher is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Streicher, Thomas. (2018). Fibred Categories \`a la Jean B\'enabou. arXiv (Cornell University).
2.
Awodey, Steve, et al.. (2018). Relating Topos Theory and Set Theory Via Categories of Classes. Figshare. 1 indexed citations
3.
Ishihara, Hajime, et al.. (2018). Consistency of the intensional level of the Minimalist Foundation with Church’s thesis and axiom of choice. Archive for Mathematical Logic. 57(7-8). 873–888. 6 indexed citations
4.
Escardó, Martı́n Hötzel & Thomas Streicher. (2016). The intrinsic topology of Martin-Löf universes. Annals of Pure and Applied Logic. 167(9). 794–805. 2 indexed citations
5.
Streicher, Thomas, et al.. (2015). Models of intuitionistic set theory in subtoposes of nested realizability toposes. Annals of Pure and Applied Logic. 166(6). 729–739. 1 indexed citations
6.
Keimel, Klaus, et al.. (2014). Observationally-induced algebras in Domain Theory. Logical Methods in Computer Science. Volume 10, Issue 3. 1 indexed citations
7.
Awodey, Steve, et al.. (2013). Relating first-order set theories, toposes and categories of classes. Annals of Pure and Applied Logic. 165(2). 428–502. 4 indexed citations
8.
Reus, Bernhard & Thomas Streicher. (2012). A synthetic theory of sequential domains. Annals of Pure and Applied Logic. 163(8). 1062–1074.
9.
Streicher, Thomas, et al.. (2012). Realizability models refuting Ishiharaʼs boundedness principle. Annals of Pure and Applied Logic. 163(12). 1803–1807. 3 indexed citations
10.
Oliva, Paulo & Thomas Streicher. (2008). On Krivine's Realizability Interpretation of Classical Second-Order Arithmetic. Fundamenta Informaticae. 84(2). 207–220. 6 indexed citations
11.
Keimel, Klaus, et al.. (2008). A Minkowski type duality mediating between state and predicate transformer semantics for a probabilistic nondeterministic language. Annals of Pure and Applied Logic. 159(3). 307–317. 3 indexed citations
12.
Reus, Bernhard & Thomas Streicher. (2004). Semantics and logic of object calculi. Theoretical Computer Science. 316(1-3). 191–213. 8 indexed citations
13.
Bunge, Marta, et al.. (2002). The Michael completion of a topos spread. Journal of Pure and Applied Algebra. 175(1-3). 63–91. 3 indexed citations
14.
Hofmann, Martin & Thomas Streicher. (2002). Completeness of Continuation Models for λμ-Calculus. Information and Computation. 179(2). 332–355. 12 indexed citations
15.
Streicher, Thomas. (2000). Practical Foundations of Mathematics. Science of Computer Programming. 38(1-3). 155–157. 22 indexed citations
16.
Bunge, Marta, et al.. (2000). Distribution Algebras and Duality. Advances in Mathematics. 156(1). 133–155. 2 indexed citations
17.
Escardó, Martı́n Hötzel & Thomas Streicher. (1999). Induction and recursion on the partial real line with applications to Real PCF. Theoretical Computer Science. 210(1). 121–157. 17 indexed citations
18.
Hofmann, Martin & Thomas Streicher. (1997). Continuation models are universal for lambda-mu-calculus. 387–395. 18 indexed citations
19.
Streicher, Thomas. (1992). Independence of the induction principle ad the axiom of choice in the pure calculus of constructions. Theoretical Computer Science. 103(2). 395–408. 5 indexed citations
20.
Streicher, Thomas. (1991). Semantics of Type Theory: Correctness, Completeness and Independence Results. Medical Entomology and Zoology. 10–2. 18 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

Rankless by CCL
2026