| 2008 |
|---|
| 16 | EE | Martin Avanzini,
Georg Moser:
Complexity Analysis by Rewriting.
FLOPS 2008: 130-146 |
| 2007 |
|---|
| 15 | EE | Nachum Dershowitz,
Georg Moser:
The Hydra Battle Revisited.
Rewriting, Computation and Proof 2007: 1-27 |
| 2006 |
|---|
| 14 | EE | Georg Moser:
Derivational Complexity of Knuth-Bendix Orders Revisited.
LPAR 2006: 75-89 |
| 13 | EE | Georg Moser:
Ackermann's substitution method (remixed).
Ann. Pure Appl. Logic 142(1-3): 1-18 (2006) |
| 12 | EE | Matthias Baaz,
Georg Moser:
Herbrand's theorem and term induction.
Arch. Math. Log. 45(4): 447-503 (2006) |
| 11 | EE | Georg Moser,
Richard Zach:
The Epsilon Calculus and Herbrand Complexity.
Studia Logica 82(1): 133-155 (2006) |
| 2005 |
|---|
| 10 | EE | Toshiyasu Arai,
Georg Moser:
Proofs of Termination of Rewrite Systems for Polytime Functions.
FSTTCS 2005: 529-540 |
| 9 | EE | Arnold Beckmann,
Jeremy Avigad,
Georg Moser:
Preface.
Ann. Pure Appl. Logic 136(1-2): 1-2 (2005) |
| 2003 |
|---|
| 8 | EE | Georg Moser,
Richard Zach:
The Epsilon Calculus (Tutorial).
CSL 2003: 455 |
| 7 | EE | Georg Moser,
Andreas Weiermann:
Relating Derivation Lengths with the Slow-Growing Hierarchy Directly.
RTA 2003: 296-310 |
| 2002 |
|---|
| 6 | EE | Matthias Baaz,
Georg Moser:
On Generalizations of Semi-terms of Particularly Simple Form.
CSL 2002: 382-396 |
| 5 | | Georg Moser:
Foreword.
Theor. Comput. Sci. 288(1): 1 (2002) |
| 2001 |
|---|
| 4 | EE | Matthias Baaz,
Georg Moser:
On a Generalisation of Herbrand's Theorem.
CSL 2001: 469-483 |
| 3 | EE | Christian G. Fermüller,
Georg Moser,
Richard Zach:
Tableaux for Reasoning About Atomic Updates.
LPAR 2001: 639-653 |
| 2000 |
|---|
| 2 | EE | Christian G. Fermüller,
Georg Moser:
Have Spass with OCC1Ng=.
LPAR 2000: 114-130 |
| 1999 |
|---|
| 1 | EE | Matthias Baaz,
Alexander Leitsch,
Georg Moser:
System Description: CutRes 0.1: Cut Elimination by Resolution.
CADE 1999: 212-216 |
