 | Up a level |
Ranzi, Florian; Strahm, Thomas (2019). A flexible type system for the small Veblen ordinal. Archive for mathematical logic, 58(5-6), pp. 711-751. Springer-Verlag 10.1007/s00153-019-00658-x
Strahm, Thomas Adrian (2017). Unfolding Schematic Systems. In: Feferman on Foundations. Outstanding Contributions to Logic: Vol. 13 (pp. 187-208). Cham: Springer International Publishing 10.1007/978-3-319-63334-3_8
Buchholtz, Ulrik Torben; Jäger, Gerhard; Strahm, Thomas Adrian (2016). Theories of proof-theoretic strength ψ(ΓΩ+1). In: Probst, Dieter; Schuster, Peter (eds.) Concepts of Proof in Mathematics, Philosophy, and ComputerScience. Ontos Mathematical Logic: Vol. 6 (pp. 115-140). De Gruyter 10.1515/9781501502620-007
Kahle, Reinhard; Strahm, Thomas Adrian; Studer, Thomas (eds.) (2016). Advances in Proof Theory. Progress in Computer Science and Applied Logic: Vol. 28. Cham: Springer International Publishing 10.1007/978-3-319-29198-7
Eberhard, Sebastian; Strahm, Thomas Adrian (2015). Unfolding Feasible Arithmetic and Weak Truth. In: Achourioti, Theodora; Galinon, Henri; Martínez Fernández, José; Fujimoto, Kentaro (eds.) Unifying the Philosophy of Truth. Logic, Epistemology, and the Unity of Science: Vol. 36 (pp. 153-167). Dordrecht: Springer Netherlands 10.1007/978-94-017-9673-6_7
Ranzi, Florian (2015). From a Flexible Type System to Metapredicative Wellordering Proofs. (Dissertation, Institut für Informatik und angewandte Mathematik, Philosophisch-naturwissenschaftliche Fakultät)
Strahm, Thomas Adrian; Sommaruga, Giovanni (eds.) (2015). Turing's Revolution: The Impact of His Ideas about Computability. Birkhäuser Basel 10.1007/978-3-319-22156-4
Ranzi, Florian; Strahm, Thomas Adrian (2014). A note on the theory SID<ω of stratified induction. Mathematical Logic Quarterly, 60(6), pp. 487-497. 10.1002/malq.201300063
Eberhard, Sebastian; Strahm, Thomas (2012). Weak theories of truth and explicit mathematics. In: Berger, Ulrich; Diener, Hannes; Schuster, Peter (eds.) Logic, Construction, Computation (pp. 157-184). Heusenstamm bei Frankfurt: Ontos
Probst, Dieter; Strahm, Thomas (2011). Admissible closures of polynomial time computable arithmetic. Archive for mathematical logic, 50(5-6), pp. 643-660. Berlin: Springer-Verlag 10.1007/s00153-011-0238-7
Spescha, Daria; Strahm, Thomas (2011). Realizability in weak systems of explicit mathematics. Mathematical logic quarterly, 57(6), pp. 551-565. Weinheim: Wiley-VCH
Spescha, Daria; Strahm, Thomas (2010). Realisability in weak systems of explicit mathematics. Mathematical logic quarterly, 57(6), pp. 551-565. Weinheim: Wiley-VCH 10.1002/malq.201020064
Strahm, Thomas (2010). Weak theories of operations and types. In: Schindler, Ralf (ed.) Ways of Proof Theory. Ontos mathematical logic: Vol. 2 (pp. 441-468). Heusenstamm bei Frankfurt: Ontos
Feferman, Solomon; Strahm, Thomas (2010). Unfolding finitist arithmetic. Review of symbolic logic, 3(4), pp. 665-689. Cambridge, Mass.: Cambridge University Press 10.1017/S1755020310000183
Spescha, Daria; Strahm, Thomas (2009). Elementary explicit types and polynomial time operations. Mathematical logic quarterly, 55(3), pp. 245-258. Weinheim: Wiley-VCH 10.1002/malq.200810004
Strahm, Thomas; Zucker, Jeffery (2008). Primitive recursive selection functions for existential assertions over abstract algebras. Journal of logic and algebraic programming, 76(2), pp. 175-197. New York, N.Y.: North-Holland 10.1016/j.jlap.2008.02.002
Strahm, Thomas (ed.) (2008). Dialectica. Special Issue: Gödel's dialectica Interpretation, 62(2). John Wiley & Sons 10.1111/j.1746-8361.2008.01135.x
Steiner, David; Strahm, Thomas (2006). On the proof theory of type two functionals based on primitive recursive operations. Mathematical logic quarterly, 52(3), pp. 237-252. Weinheim: Wiley-VCH 10.1002/malq.200510029
Strahm, Thomas (2003). Sergei Tupailo. Realization of analysis into explicit mathematics. The Journal of Symbolic Logic, vol. 66 (2001), pp. 1848–1864 [Review]. The Bulletin of Symbolic Logic, 9(1), pp. 42-43. Cambridge University Press 10.1017/S1079898600004741
Strahm, Thomas (2002). Wellordering proofs for metapredicative Mahlo. The journal of symbolic logic, 67(1), pp. 260-278. Cambridge University Press 10.2178/jsl/1190150043
Strahm, Thomas (2002). Andreas Weiermann. How is it that infinitary methods can be applied to finitary mathematics? Gödel's T: a case study. The journal of symbolic logic, vol. 63 (1998), pp. 1348–1370 [Review]. The Bulletin of Symbolic Logic, 8(3), pp. 435-436. Cambridge University Press 10.2178/bsl/1182353903
Jäger, Gerhard; Strahm, Thomas (2001). Upper bounds for metapredicative Mahlo in explicit mathematics and admissible set theory. The journal of symbolic logic, 66(2), pp. 935-958. Cambridge University Press 10.2307/2695054
Jäger, Gerhard Max; Kahle, Reinhard; Setzer, Anton; Strahm, Thomas Adrian (1999). The proof-theoretic analysis of transfinitely iterated fixed point theories. The journal of symbolic logic, 64(01), pp. 53-67. Cambridge University Press 10.2307/2586750
Strahm, Thomas (1997). Polynomial time operations in explicit mathematics. The journal of symbolic logic, 62(2), pp. 575-594. Cambridge University Press 10.2307/2275547
Strahm, Thomas (1996). Partial Applicative Theories and Explicit Substitutions. Journal of logic and computation, 6(1), pp. 55-77. Oxford University Press 10.1093/logcom/6.1.55
Jäger, Gerhard; Strahm, Thomas (1996). Some theories with positive induction of ordinal strength φω0. The journal of symbolic logic, 61(3), pp. 818-842. Cambridge University Press 10.2307/2275787
