| | |
- CSB - MetaPress - Google - Bing - Yahoo
 | 2010 | |
|---|---|---|
| 6 |      | Mathias Barra, Philipp Gerhardy: The Ordinal of Skolem + Tetration Is tau0. CiE 2010: 31-38 |
| 5 | | Mathias Barra: Bounded minimalisation and bounded counting in argument-bounded idc's. Mathematical Structures in Computer Science 20(5): 753-779 (2010) |
| 2009 | ||
| 4 | | Mathias Barra, Philipp Gerhardy: Skolem + Tetration Is Well-Ordered. CiE 2009: 11-20 |
| 2008 | ||
| 3 | | Mathias Barra: Pure Iteration and Periodicity. CiE 2008: 42-51 |
| 2 | | Mathias Barra: A Characterisation of the Relations Definable in Presburger Arithmetic. TAMC 2008: 258-269 |
| 2005 | ||
| 1 | | Lars Kristiansen, Mathias Barra: The Small Grzegorczyk Classes and the Typed lambda-Calculus. CiE 2005: 252-262 |
| 1 | Philipp Gerhardy | [4] [6] |
| 2 | Lars Kristiansen | [1] |
Colors in the list of coauthors
Last update Sun May 27 04:04:01 2012 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page