Assoc. Prof. Dr. Georg Moser   

selected invited talks

Epsilon Calculus I
International Summer School for Proof Theory in First-Order Logic in Funchal, Madeira, August 22 – 27, 2017

Termination and Complexity
8th International School on Rewriting (ISR 2015), August 13-18, Leipzig, Germany.

Weighted Automata Theory for Complexity Analysis of Rewrite Systems
16th Workshop on Logic and Computational Complexity (LCC 2014), July 12, 2014, Vienna, Austria.

Automated Complexity Analysis Based on the Dependency Pair Method
5th Workshop on Developments in Implicit Computational Complexity (DICE 2015), April 5, 2014, Grenoble, France.

Complexity Analysis of Java Bytecode Programs
IFIP Working Group 1.6 on Term Rewriting. July 10, Edinbrugh, UK

Complexity Analyses of Term Rewrite Systems
5th International School on Rewriting (ISR 2010), July 3-8, 2010, Utrecht, Netherlands

Automated Complexity Analysis of Rewriting
CONCERTO, June 9-11, 2010, Turin, Italy

Complexity Analyses of Term Rewrite Systems
IFIP Working Group 1.6 on Term Rewriting, July 2, 2009, Brazil, BR

The Epsilon Theorems and Herbrand Complexity
APS-4, CMU Quatar, November 22, 2008, Doha, Quatar

Ackermann's Substitution Method (remixed)
Collegium Logicum: Cut-Elimination, July 4--6, 2005, Vienna, Austria

The Epsilon Calculus
Together with Richard Zach
Computer Science Logic, August 25--30, 2003, Vienna, Austria

Why Ordinals are Good for You
Together with Ingo Lepper
15th European Summer School in Logic Language and Information (ESSLLI 2003), August 18--29, 2003, Vienna, Austria

Generalizations of Simple Form
Second Moscow-Vienna Workshop on Logic and Computation, Steklov Institute, April 2002, Moscow, Russia