] Filters: Author is Thomas Strahm [Clear All Filters]
.
Submitted. Unfolding feasible arithmetic and weak truth.
.
Submitted. Weak theories of truth and explicit mathematics.
.
2011. Admissible closures of polynomial time computable arithmetic. Archive for Mathematical Logic. 50(5-6):643-660.
.
2011. Realizability in weak systems of explicit mathematics. Mathematical Logic Quarterly. 57(6):551-565.
.
2010. Weak theories of operations and types. Ways of {P}roof {T}heory. :441–468.
.
2010. Unfolding finitist arithmetic. Review of Symbolic Logic. 3:665–689.
.
2009. Elementary explicit types and polynomial time operations. Mathematical Logic Quarterly. 55:245–258.
.
2008. Gödel's Dialectica Interpretation.
.
2008. 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.
.
2006. On the proof theory of type two functionals based on primitive recursive operations. Mathematical Logic Quarterly. 52:237{–}252.
.
2005. Reflections on reflections in explicit mathematics. Annals of Pure and Applied Logic. 136:116{–}133.
.
2004. A proof-theoretic characterization of the basic feasible functionals. Theoretical Computer Science. 329:159{–}176.
.
2003. Theories with self-application and computational complexity. Information and Computation. 185:263{–}297.
.
2002. The proof-theoretic analysis of the Suslin operator in applicative theories. Reflections on the Foundations of Mathematics: Essays in Honor of Solomon Feferman. :270{–}292.
.
2002. Intuitionistic fixed point theories for strictly positive operators. Mathematical Logic Quarterly. 48:195{–}202.
.
2002. Wellordering proofs for metapredicative Mahlo. The Journal of Symbolic Logic. 67:260{–}278.
.
2001. Upper bounds for metapredicative Mahlo in explicit mathematics and admissible set theory. The Journal of Symbolic Logic. 66:935{–}958.
.
2000. The non-constructive $μ$-operator, fixed point theories with ordinals, and the bar rule. Annals of Pure and Applied Logic. 104:305{–}324.
.
2000. Autonomous fixed point progressions and fixed point transfinite recursion. Proceedings of Logic Colloquium '98. 13:449{–}464.
.
2000. Fixed point theories and dependent choice. Archive for Mathematical Logic. 39:493{–}508.
.
2000. The unfolding of non-finitist arithmetic. Annals of Pure and Applied Logic. 104:75{–}96.
.
1999. Bar induction and $\omega$ model reflection. Annals of Pure and Applied Logic. 97:221{–}230.
.
1999. First steps into metapredicativity in explicit mathematics. Sets and Proofs. 258:383{–}402.
