Thomas Strahm

According to our database, Thomas Strahm authored at least 27 papers between 1995 and 2019.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2019

A flexible type system for the small Veblen ordinal.

Florian Ranzi, Thomas Strahm

Arch. Math. Log., 2019

2016

Katalin Bimbó. Proof Theory: Sequent Calculi and Related Formalisms. CRC Press, Boca Raton, 2014, x + 374 pp.

Thomas Strahm

Bull. Symb. Log., 2016

2014

A note on the theory SID<ω of stratified induction.

Florian Ranzi, Thomas Strahm

Math. Log. Q., 2014

2011

Realisability in weak systems of explicit mathematics.

Daria Spescha, Thomas Strahm

Math. Log. Q., 2011

Admissible closures of polynomial time computable arithmetic.

Dieter Probst, Thomas Strahm

Arch. Math. Log., 2011

2010

Unfolding Finitist Arithmetic.

Solomon Feferman, Thomas Strahm

Rev. Symb. Log., 2010

2009

Elementary explicit types and polynomial time operations.

Daria Spescha, Thomas Strahm

Math. Log. Q., 2009

2008

Primitive recursive selection functions for existential assertions over abstract algebras.

Thomas Strahm, Jeffery I. Zucker

J. Log. Algebraic Methods Program., 2008

2006

On the proof theory of type two functionals based on primitive recursive operations.

David Steiner, Thomas Strahm

Math. Log. Q., 2006

2005

Reflections on reflections in explicit mathematics.

Gerhard Jäger, Thomas Strahm

Ann. Pure Appl. Log., 2005

2004

A proof-theoretic characterization of the basic feasible functionals.

Thomas Strahm

Theor. Comput. Sci., 2004

2003

Theories with self-application and computational complexity.

Thomas Strahm

Inf. Comput., 2003

2002

Intuitionistic Fixed Point Theories for Strictly Positive Operators.

Christian Rüede, Thomas Strahm

Math. Log. Q., 2002

Wellordering Proofs for Metapredicative Mahlo.

Thomas Strahm

J. Symb. Log., 2002

2001

Upper Bounds for Metapredicative Mahlo in Explicit Mathematics and Admissible Set Theory.

Gerhard Jäger, Thomas Strahm

J. Symb. Log., 2001

2000

The non-constructive mu operator, fixed point theories with ordinals, and the bar rule.

Thomas Strahm

Ann. Pure Appl. Log., 2000

The unfolding of non-finitist arithmetic.

Solomon Feferman, Thomas Strahm

Ann. Pure Appl. Log., 2000

Fixed point theories and dependent choice.

Gerhard Jäger, Thomas Strahm

Arch. Math. Log., 2000

1999

The Proof-Theoretic Analysis of Transfinitely Iterated Fixed Point Theories.

Gerhard Jäger, Reinhard Kahle, Anton Setzer, Thomas Strahm

J. Symb. Log., 1999

Bar Induction and omega Model Reflection.

Gerhard Jäger, Thomas Strahm

Ann. Pure Appl. Log., 1999

1998

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

1997

Polynomial Time Operations in Explicit Mathematics.

Thomas Strahm

J. Symb. Log., 1997

1996

Partial Applicative Theories and Explicit Substitutions.

Thomas Strahm

J. Log. Comput., 1996

Some Theories with Positive Induction of Ordinal Strength <i>phi omega 0</i>.

Gerhard Jäger, Thomas Strahm

J. Symb. Log., 1996

Systems of Explicit Mathematics with Non-Constructive µ-Operator and Join.

Thomas Glaß, Thomas Strahm

Ann. Pure Appl. Log., 1996

1995

Totality in Applicative Theories.

Gerhard Jäger, Thomas Strahm

Ann. Pure Appl. Log., 1995

Second order theories with ordinals and elementary comprehension.

Gerhard Jäger, Thomas Strahm

Arch. Math. Log., 1995