Thomas Strahm

468 total citations
29 papers, 207 citations indexed

About

Thomas Strahm is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Geometry and Topology. According to data from OpenAlex, Thomas Strahm has authored 29 papers receiving a total of 207 indexed citations (citations by other indexed papers that have themselves been cited), including 23 papers in Computational Theory and Mathematics, 18 papers in Artificial Intelligence and 5 papers in Geometry and Topology. Recurrent topics in Thomas Strahm's work include Computability, Logic, AI Algorithms (18 papers), Logic, programming, and type systems (16 papers) and Logic, Reasoning, and Knowledge (11 papers). Thomas Strahm is often cited by papers focused on Computability, Logic, AI Algorithms (18 papers), Logic, programming, and type systems (16 papers) and Logic, Reasoning, and Knowledge (11 papers). Thomas Strahm collaborates with scholars based in Switzerland, Germany and United States. Thomas Strahm's co-authors include Gerhard Jäger, Gerhard Jäger, Solomon Feferman, Reinhard Kähle, Anton Setzer, Thomas Studer and J. I. Zucker and has published in prestigious journals such as Theoretical Computer Science, Journal of Symbolic Logic and Information and Computation.

In The Last Decade

Thomas Strahm

28 papers receiving 181 citations

Peers — A (Enhanced Table)

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

Name	h						Papers	Cites
Thomas Strahm Switzerland	9	178	155	63	32	13	29	207
Gerhard Jäger Switzerland	10	184 1.0×	171 1.1×	55 0.9×	53 1.7×	10 0.8×	21	218
Philip Kremer Canada	9	139 0.8×	189 1.2×	62 1.0×	11 0.3×	8 0.6×	29	239
Reinhard Kähle Portugal	6	71 0.4×	85 0.5×	41 0.7×	20 0.6×	8 0.6×	36	133
Peter G. Hinman United States	7	231 1.3×	122 0.8×	37 0.6×	76 2.4×	38 2.9×	17	273
Richard Zach Canada	11	222 1.2×	215 1.4×	50 0.8×	12 0.4×	10 0.8×	35	305
S. K. Thomason Canada	13	220 1.2×	240 1.5×	27 0.4×	27 0.8×	9 0.7×	24	338
Wolfram Pohlers Germany	8	224 1.3×	177 1.1×	44 0.7×	61 1.9×	35 2.7×	17	292
R. E. Vesley United States	5	263 1.5×	228 1.5×	27 0.4×	62 1.9×	40 3.1×	9	364
Wim Veldman Netherlands	7	112 0.6×	90 0.6×	15 0.2×	48 1.5×	23 1.8×	24	163
Akiko Kino Ghana	5	163 0.9×	131 0.8×	19 0.3×	25 0.8×	30 2.3×	8	229

Countries citing papers authored by Thomas Strahm

Since Specialization

Citations

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

Fields of papers citing papers by Thomas Strahm

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Thomas Strahm

This figure shows the co-authorship network connecting the top 25 collaborators of Thomas Strahm. A scholar is included among the top collaborators of Thomas Strahm 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 Strahm. Thomas Strahm 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

Kähle, Reinhard, Thomas Strahm, & Thomas Studer. (2016). Advances in Proof Theory. CERN Document Server (European Organization for Nuclear Research). 2 indexed citations

Strahm, Thomas, et al.. (2015). Turing’s Revolution. CERN Document Server (European Organization for Nuclear Research). 3 indexed citations

Strahm, Thomas, et al.. (2011). Realisability in weak systems of explicit mathematics. Mathematical logic quarterly. 57(6). 551–565. 4 indexed citations

Feferman, Solomon & Thomas Strahm. (2010). UNFOLDING FINITIST ARITHMETIC. The Review of Symbolic Logic. 3(4). 665–689. 4 indexed citations

Jäger, Gerhard & Thomas Strahm. (2005). Reflections on reflections in explicit mathematics. Annals of Pure and Applied Logic. 136(1-2). 116–133. 5 indexed citations

Strahm, Thomas. (2004). A proof-theoretic characterization of the basic feasible functionals. Theoretical Computer Science. 329(1-3). 159–176. 8 indexed citations

Strahm, Thomas. (2003). Theories with self-application and computational complexity. Information and Computation. 185(2). 263–297. 11 indexed citations

Strahm, Thomas. (2002). Wellordering proofs for metapredicative Mahlo. Journal of Symbolic Logic. 67(1). 260–278. 9 indexed citations

Strahm, Thomas, et al.. (2002). Intuitionistic Fixed Point Theories for Strictly Positive Operators. Mathematical logic quarterly. 48(2). 195–202. 4 indexed citations

10.

Strahm, Thomas. (2001). Proof-theoretic contributions to explicit mathematics. 4 indexed citations

11.

Jäger, Gerhard & Thomas Strahm. (2001). Upper bounds for metapredicative Mahlo in explicit mathematics and admissible set theory. Journal of Symbolic Logic. 66(2). 935–958. 21 indexed citations

12.

Feferman, Solomon & Thomas Strahm. (2000). The unfolding of non-finitist arithmetic. Annals of Pure and Applied Logic. 104(1-3). 75–96. 14 indexed citations

13.

Strahm, Thomas. (2000). The non-constructive μ operator, fixed point theories with ordinals, and the bar rule. Annals of Pure and Applied Logic. 104(1-3). 305–324. 4 indexed citations

14.

Jäger, Gerhard & Thomas Strahm. (1999). Bar induction and ω model reflection. Annals of Pure and Applied Logic. 97(1-3). 221–230. 11 indexed citations

15.

Jäger, Gerhard, Reinhard Kähle, Anton Setzer, & Thomas Strahm. (1999). The proof-theoretic analysis of transfinitely iterated fixed point theories. Journal of Symbolic Logic. 64(1). 53–67. 22 indexed citations

16.

Strahm, Thomas, et al.. (1998). The $\mu$ quantification operator in explicit mathematics with universes and iterated fixed point theories with ordinals. Archive for Mathematical Logic. 37(5-6). 391–413. 6 indexed citations

17.

Strahm, Thomas. (1997). Polynomial time operations in explicit mathematics. Journal of Symbolic Logic. 62(2). 575–594. 6 indexed citations

18.

Strahm, Thomas. (1996). Partial applicative theories and explicit substitutions. Journal of Logic and Computation. 6(1). 57–79. 1 indexed citations

19.

Strahm, Thomas, et al.. (1996). Systems of explicit mathematics with non-constructive μ-operator and join. Annals of Pure and Applied Logic. 82(2). 193–219. 7 indexed citations

20.

Jäger, Gerhard & Thomas Strahm. (1995). Totality in applicative theories. Annals of Pure and Applied Logic. 74(2). 105–120. 20 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