Thomas Strahm - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 27 from 27

2019

A flexible type system for the small Veblen ordinalFlorian Ranzi, Thomas Strahm. AML, 58(5-6):711-751, 2019. [doi]

2016

Katalin Bimbó. Proof Theory: Sequent Calculi and Related Formalisms. CRC Press, Boca Raton, 2014, x + 374 ppThomas Strahm. bsl, 22(2):288-289, 2016. [doi]

2014

A note on the theory SID<ω of stratified inductionFlorian Ranzi, Thomas Strahm. mlq, 60(6):487-497, 2014. [doi]

2011

Admissible closures of polynomial time computable arithmeticDieter Probst, Thomas Strahm. AML, 50(5-6):643-660, 2011. [doi]

Realisability in weak systems of explicit mathematicsDaria Spescha, Thomas Strahm. mlq, 57(6):551-565, 2011. [doi]

2010

Unfolding Finitist ArithmeticSolomon Feferman, Thomas Strahm. rsl, 3(4):665-689, 2010. [doi]

2009

Elementary explicit types and polynomial time operationsDaria Spescha, Thomas Strahm. mlq, 55(3):245-258, 2009. [doi]

2008

Primitive recursive selection functions for existential assertions over abstract algebrasThomas Strahm, Jeffery I. Zucker. jlp, 76(2):175-197, 2008. [doi]

2006

On the proof theory of type two functionals based on primitive recursive operationsDavid Steiner, Thomas Strahm. mlq, 52(3):237-252, 2006. [doi]

2005

Reflections on reflections in explicit mathematicsGerhard Jäger, Thomas Strahm. APAL, 136(1-2):116-133, 2005. [doi]

2004

A proof-theoretic characterization of the basic feasible functionalsThomas Strahm. TCS, 329(1-3):159-176, 2004. [doi]

2003

Theories with self-application and computational complexityThomas Strahm. iandc, 185(2):263-297, 2003. [doi]

2002

Intuitionistic Fixed Point Theories for Strictly Positive OperatorsChristian Rüede, Thomas Strahm. mlq, 48(2):195-202, 2002. [doi]

Wellordering Proofs for Metapredicative MahloThomas Strahm. JSYML, 67(1):260-278, 2002.

2001

Upper Bounds for Metapredicative Mahlo in Explicit Mathematics and Admissible Set TheoryGerhard Jäger, Thomas Strahm. JSYML, 66(2):935-958, 2001.

2000

The unfolding of non-finitist arithmeticSolomon Feferman, Thomas Strahm. APAL, 104(1-3):75-96, 2000.

Fixed point theories and dependent choiceGerhard Jäger, Thomas Strahm. AML, 39(7):493-508, 2000. [doi]

The non-constructive mu operator, fixed point theories with ordinals, and the bar ruleThomas Strahm. APAL, 104(1-3):305-324, 2000.

1999

Bar Induction and omega Model ReflectionGerhard Jäger, Thomas Strahm. APAL, 97(1-3):221-230, 1999.

The Proof-Theoretic Analysis of Transfinitely Iterated Fixed Point TheoriesGerhard Jäger, Reinhard Kahle, Anton Setzer, Thomas Strahm. JSYML, 64(1):53-67, 1999.

1998

The m/mu quantification operator in explicit mathematics with universes and iterated fixed point theories with ordinalsMarkus Marzetta, Thomas Strahm. AML, 37(5-6):391-413, 1998. [doi]

1997

Polynomial Time Operations in Explicit MathematicsThomas Strahm. JSYML, 62(2):575-594, 1997.

1996

Systems of Explicit Mathematics with Non-Constructive µ-Operator and JoinThomas Glaß, Thomas Strahm. APAL, 82(2):193-219, 1996.

Some Theories with Positive Induction of Ordinal Strength ::::phi omega 0::::Gerhard Jäger, Thomas Strahm. JSYML, 61(3):818-842, 1996.

Partial Applicative Theories and Explicit SubstitutionsThomas Strahm. logcom, 6(1):55-77, 1996.

1995

Totality in Applicative TheoriesGerhard Jäger, Thomas Strahm. APAL, 74(2):105-120, 1995.

Second order theories with ordinals and elementary comprehensionGerhard Jäger, Thomas Strahm. AML, 34(6):345-375, 1995. [doi]

Sign in or sign up to see more results.

runs on WebDSL