Thomas Strahm - RankMe

27 papers Journal 27

Year	Rank	Type	Title / Venue / Authors
2019	J	`jnl`	A flexible type system for the small Veblen ordinal. Arch. Math. Log. Florian Ranzi, Thomas Strahm
2016	J	`jnl`	Katalin Bimbó. Proof Theory: Sequent Calculi and Related Formalisms. CRC Press, Boca Raton, 2014, x + 374 pp. Bull. Symb. Log. Thomas Strahm
2014	J	`jnl`	A note on the theory SID<ω of stratified induction. Math. Log. Q. Florian Ranzi, Thomas Strahm
2011	J	`jnl`	Admissible closures of polynomial time computable arithmetic. Arch. Math. Log. Dieter Probst, Thomas Strahm
2011	J	`jnl`	Realisability in weak systems of explicit mathematics. Math. Log. Q. Daria Spescha, Thomas Strahm
2010	J	`jnl`	Unfolding Finitist Arithmetic. Rev. Symb. Log. Solomon Feferman, Thomas Strahm
2009	J	`jnl`	Elementary explicit types and polynomial time operations. Math. Log. Q. Daria Spescha, Thomas Strahm
2008	J	`jnl`	Primitive recursive selection functions for existential assertions over abstract algebras. J. Log. Algebraic Methods Program. Thomas Strahm, Jeffery I. Zucker
2006	J	`jnl`	On the proof theory of type two functionals based on primitive recursive operations. Math. Log. Q. David Steiner, Thomas Strahm
2005	J	`jnl`	Reflections on reflections in explicit mathematics. Ann. Pure Appl. Log. Gerhard Jäger, Thomas Strahm
2004	J	`jnl`	A proof-theoretic characterization of the basic feasible functionals. Theor. Comput. Sci. Thomas Strahm
2003	J	`jnl`	Theories with self-application and computational complexity. Inf. Comput. Thomas Strahm
2002	J	`jnl`	Intuitionistic Fixed Point Theories for Strictly Positive Operators. Math. Log. Q. Christian Rüede, Thomas Strahm
2002	J	`jnl`	Wellordering Proofs for Metapredicative Mahlo. J. Symb. Log. Thomas Strahm
2001	J	`jnl`	Upper Bounds for Metapredicative Mahlo in Explicit Mathematics and Admissible Set Theory. J. Symb. Log. Gerhard Jäger, Thomas Strahm
2000	J	`jnl`	Fixed point theories and dependent choice. Arch. Math. Log. Gerhard Jäger, Thomas Strahm
2000	J	`jnl`	The non-constructive mu operator, fixed point theories with ordinals, and the bar rule. Ann. Pure Appl. Log. Thomas Strahm
2000	J	`jnl`	The unfolding of non-finitist arithmetic. Ann. Pure Appl. Log. Solomon Feferman, Thomas Strahm
1999	J	`jnl`	Bar Induction and omega Model Reflection. Ann. Pure Appl. Log. Gerhard Jäger, Thomas Strahm
1999	J	`jnl`	The Proof-Theoretic Analysis of Transfinitely Iterated Fixed Point Theories. J. Symb. Log. Gerhard Jäger, Reinhard Kahle, Anton Setzer, Thomas Strahm
1998	J	`jnl`	The m\mu quantification operator in explicit mathematics with universes and iterated fixed point theories with ordinals. Arch. Math. Log. Markus Marzetta, Thomas Strahm
1997	J	`jnl`	Polynomial Time Operations in Explicit Mathematics. J. Symb. Log. Thomas Strahm
1996	J	`jnl`	Partial Applicative Theories and Explicit Substitutions. J. Log. Comput. Thomas Strahm
1996	J	`jnl`	Some Theories with Positive Induction of Ordinal Strength J. Symb. Log. Gerhard Jäger, Thomas Strahm
1996	J	`jnl`	Systems of Explicit Mathematics with Non-Constructive µ-Operator and Join. Ann. Pure Appl. Log. Thomas Glaß, Thomas Strahm
1995	J	`jnl`	Second order theories with ordinals and elementary comprehension. Arch. Math. Log. Gerhard Jäger, Thomas Strahm
1995	J	`jnl`	Totality in Applicative Theories. Ann. Pure Appl. Log. Gerhard Jäger, Thomas Strahm