# Publications

Export 41 results:
Filters: Author is Thomas Strahm  [Clear All Filters]
Submitted
In Press
Strahm, T.: Unfolding schematic systems. In: Feferman on Foundations - Logic, Mathematics, Philosophy. Springer (In Press).
2016
: Advances in Proof Theory. Birkhäuser (2016).
: Theories of proof-theoretic strength $\psi$($\Gamma_{\Omega+1}$). In: Concepts of Proof in Mathematics, Philosophy, and Computer Science. De Gruyter (2016).
2015
: Unfolding Feasible Arithmetic and Weak Truth. In: Unifying the Philosophy of Truth. pp. 153-167. Springer Netherlands, Dordrecht (2015).
2014
: A note on the theory $\mathsf{SID}_{{<}\omega}$ of stratified induction. Mathematical Logic Quarterly. 60, 487-497 (2014).
2012
: Weak theories of truth and explicit mathematics. In: Logic, Construction, Computation. pp. 157-184. Ontos Verlag (2012).
2011
: Admissible closures of polynomial time computable arithmetic. Archive for Mathematical Logic. 50, 643-660 (2011).
: Realizability in weak systems of explicit mathematics. Mathematical Logic Quarterly. 57, 551-565 (2011).
2010
: Unfolding finitist arithmetic. Review of Symbolic Logic. 3, 665-689 (2010).
Strahm, T.: Weak theories of operations and types. In: Schindler, R. Ways of Proof Theory. pp. 441-468. Ontos Verlag (2010).
2009
: Elementary explicit types and polynomial time operations. Mathematical Logic Quarterly. 55, 245-258 (2009).
2008
Strahm, T.: Gödel's Dialectica Interpretation. Wiley (2008).
Strahm, T.: Introduction. Dialectica. 62, 145-147 (2008).
: Primitive recursive selection functions for existential assertions over abstract algebras. Journal of Logic and Algebraic Programming. 76, 175-197 (2008).
2006
: On the proof theory of type two functionals based on primitive recursive operations. Mathematical Logic Quarterly. 52, 237-252 (2006).
2005
: Reflections on reflections in explicit mathematics. Annals of Pure and Applied Logic. 136, 116-133 (2005).
2004
Strahm, T.: A proof-theoretic characterization of the basic feasible functionals. Theoretical Computer Science. 329, 159-176 (2004).
2003
Strahm, T.: Theories with self-application and computational complexity. Information and Computation. 185, 263-297 (2003).
2002
: Intuitionistic fixed point theories for strictly positive operators. Mathematical Logic Quarterly. 48, 195-202 (2002).
: The proof-theoretic analysis of the Suslin operator in applicative theories. In: Reflections on the Foundations of Mathematics: Essays in Honor of Solomon Feferman. pp. 270-292. AK Peters (2002).
Strahm, T.: Wellordering proofs for metapredicative Mahlo. The Journal of Symbolic Logic. 67, 260-278 (2002).
2001
: Upper bounds for metapredicative Mahlo in explicit mathematics and admissible set theory. The Journal of Symbolic Logic. 66, 935-958 (2001).