Search the dblp DataBase

Publications of Author

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