2008 |
19 | EE | Thomas Strahm,
Jeffery I. Zucker:
Primitive recursive selection functions for existential assertions over abstract algebras.
J. Log. Algebr. Program. 76(2): 175-197 (2008) |
2006 |
18 | EE | David Steiner,
Thomas Strahm:
On the proof theory of type two functionals based on primitive recursive operations.
Math. Log. Q. 52(3): 237-252 (2006) |
2005 |
17 | EE | Gerhard Jäger,
Thomas Strahm:
Reflections on reflections in explicit mathematics.
Ann. Pure Appl. Logic 136(1-2): 116-133 (2005) |
2004 |
16 | EE | Thomas Strahm:
A proof-theoretic characterization of the basic feasible functionals.
Theor. Comput. Sci. 329(1-3): 159-176 (2004) |
2003 |
15 | EE | Thomas Strahm:
Theories with self-application and computational complexity.
Inf. Comput. 185(2): 263-297 (2003) |
2002 |
14 | | Thomas Strahm:
Wellordering Proofs for Metapredicative Mahlo.
J. Symb. Log. 67(1): 260-278 (2002) |
13 | EE | Christian Rüede,
Thomas Strahm:
Intuitionistic Fixed Point Theories for Strictly Positive Operators.
Math. Log. Q. 48(2): 195-202 (2002) |
2001 |
12 | | Gerhard Jäger,
Thomas Strahm:
Upper Bounds for Metapredicative Mahlo in Explicit Mathematics and Admissible Set Theory.
J. Symb. Log. 66(2): 935-958 (2001) |
2000 |
11 | | Thomas Strahm:
The non-constructive mu operator, fixed point theories with ordinals, and the bar rule.
Ann. Pure Appl. Logic 104(1-3): 305-324 (2000) |
10 | | Solomon Feferman,
Thomas Strahm:
The unfolding of non-finitist arithmetic.
Ann. Pure Appl. Logic 104(1-3): 75-96 (2000) |
9 | EE | Gerhard Jäger,
Thomas Strahm:
Fixed point theories and dependent choice.
Arch. Math. Log. 39(7): 493-508 (2000) |
1999 |
8 | | Gerhard Jäger,
Thomas Strahm:
Bar Induction and omega Model Reflection.
Ann. Pure Appl. Logic 97(1-3): 221-230 (1999) |
7 | | Gerhard Jäger,
Reinhard Kahle,
Anton Setzer,
Thomas Strahm:
The Proof-Theoretic Analysis of Transfinitely Iterated Fixed Point Theories.
J. Symb. Log. 64(1): 53-67 (1999) |
1998 |
6 | EE | Markus Marzetta,
Thomas Strahm:
The m\mu quantification operator in explicit mathematics with universes and iterated fixed point theories with ordinals.
Arch. Math. Log. 37(5-6): 391-413 (1998) |
1997 |
5 | | Thomas Strahm:
Polynomial Time Operations in Explicit Mathematics.
J. Symb. Log. 62(2): 575-594 (1997) |
1996 |
4 | | Thomas Glaß,
Thomas Strahm:
Systems of Explicit Mathematics with Non-Constructive µ-Operator and Join.
Ann. Pure Appl. Logic 82(2): 193-219 (1996) |
3 | | Thomas Strahm:
Partial Applicative Theories and Explicit Substitutions.
J. Log. Comput. 6(1): 55-77 (1996) |
2 | | Gerhard Jäger,
Thomas Strahm:
Some Theories with Positive Induction of Ordinal Strength phi omega 0.
J. Symb. Log. 61(3): 818-842 (1996) |
1995 |
1 | | Gerhard Jäger,
Thomas Strahm:
Totality in Applicative Theories.
Ann. Pure Appl. Logic 74(2): 105-120 (1995) |