Second order theories with ordinals and elementary comprehension. - Gerhard Jäger; Thomas Strahm (Arch. Math. Log., 1995)

Totality in Applicative Theories. - Gerhard Jäger; Thomas Strahm (Ann. Pure Appl. Log., 1995)

Systems of Explicit Mathematics with Non-Constructive µ-Operator and Join. - Thomas Glaß; Thomas Strahm (Ann. Pure Appl. Log., 1996)

Some Theories with Positive Induction of Ordinal Strength phi omega 0. - Gerhard Jäger; Thomas Strahm (J. Symb. Log., 1996)

Partial Applicative Theories and Explicit Substitutions. - Thomas Strahm (J. Log. Comput., 1996)

Polynomial Time Operations in Explicit Mathematics. - Thomas Strahm (J. Symb. Log., 1997)

The m mu quantification operator in explicit mathematics with universes and iterated fixed point theories with ordinals. - Markus Marzetta; Thomas Strahm (Arch. Math. Log., 1998)

Bar Induction and omega Model Reflection. - Gerhard Jäger; Thomas Strahm (Ann. Pure Appl. Log., 1999)

The Proof-Theoretic Analysis of Transfinitely Iterated Fixed Point Theories. - Gerhard Jäger; Reinhard Kahle; Anton Setzer; Thomas Strahm (J. Symb. Log., 1999)

Fixed point theories and dependent choice. - Gerhard Jäger; Thomas Strahm (Arch. Math. Log., 2000)

The unfolding of non-finitist arithmetic. - Solomon Feferman; Thomas Strahm (Ann. Pure Appl. Log., 2000)

The non-constructive mu operator, fixed point theories with ordinals, and the bar rule. - Thomas Strahm (Ann. Pure Appl. Log., 2000)

Upper Bounds for Metapredicative Mahlo in Explicit Mathematics and Admissible Set Theory. - Gerhard Jäger; Thomas Strahm (J. Symb. Log., 2001)

Wellordering Proofs for Metapredicative Mahlo. - Thomas Strahm (J. Symb. Log., 2002)

Intuitionistic Fixed Point Theories for Strictly Positive Operators. - Christian Rüede; Thomas Strahm (Math. Log. Q., 2002)

Theories with self-application and computational complexity. - Thomas Strahm (Inf. Comput., 2003)

A proof-theoretic characterization of the basic feasible functionals. - Thomas Strahm (Theor. Comput. Sci., 2004)

Reflections on reflections in explicit mathematics. - Gerhard Jäger; Thomas Strahm (Ann. Pure Appl. Log., 2005)

On the proof theory of type two functionals based on primitive recursive operations. - David Steiner 001; Thomas Strahm (Math. Log. Q., 2006)

Primitive recursive selection functions for existential assertions over abstract algebras. - Thomas Strahm; Jeffery I. Zucker (J. Log. Algebraic Methods Program., 2008)

Elementary explicit types and polynomial time operations. - Daria Spescha; Thomas Strahm (Math. Log. Q., 2009)

Unfolding Finitist Arithmetic. - Solomon Feferman; Thomas Strahm (Rev. Symb. Log., 2010)

Admissible closures of polynomial time computable arithmetic. - Dieter Probst; Thomas Strahm (Arch. Math. Log., 2011)

Realisability in weak systems of explicit mathematics. - Daria Spescha; Thomas Strahm (Math. Log. Q., 2011)

A note on the theory SID<ω of stratified induction. - Florian Ranzi; Thomas Strahm (Math. Log. Q., 2014)

Katalin Bimbó. Proof Theory: Sequent Calculi and Related Formalisms. CRC Press, Boca Raton, 2014, x + 374 pp. - Thomas Strahm (Bull. Symb. Log., 2016)

A flexible type system for the small Veblen ordinal. - Florian Ranzi; Thomas Strahm (Arch. Math. Log., 2019)