Analytische Kombinatorik des Transfiniten. Mathematisches Kolloquium Freiburg. (05.12.2003)

Some applications of enumeration in logic and mathematics}. Invited talk at the conference on the average case analysis of algorithms in San Miniato 2003. (06.2003)

Mathematical and logical aspects of termination orderings. Talk at the workshop on termination in Valencia 2003. (06.2003)

Some Hardy Ramanujan style counting problems. Invited talk at the Mathematical seminar of the University of Amsterdam. (02.2003)

Some Hardy Ramanujan style counting problems. Talk at the Mathematical seminar of the University of Utrecht. (01.2003)

Independence results for PA via analytic number theory. Colloquium on Mathematical Logic in Utrecht. (1.11.2002, 08.11.2002, 22.11.2002.)

A zero one law characterization of epsilon zero. Talk at the Colloquium on Mathematics and Comptuter Science in Versailles. (17.09.2002)

Some Applications of Analytic Number Theory in Logic. Talk at the 8-th seminar on the average case analysis of algorithms in Strobl. (24.06.2002)

Proof Theory. Guest Lecture at the University of Amsterdam. 10 lectures in spring and summer 2002.

Proof Theory and Analytic Number Theory. Talk at the Oberwolfach meeting on Mathematical Logic. (13.04.2002)

Applications of Analytic Number Theory in Logic. Talk at the joint Leeds Manchester Logic seminar in Manchester. (14.02.2002)

Classifying mathematical incompleteness in PA. Talk at Logic seminar in Leeds. (13.02.2002)

Applications of Analytic Number Theory in Logic. Talk at the Mathematical Seminar of the University of Johannesburg. (20.11.2001)

Applications of Analytic Number Theory in Logic. Invited talk at the Mathematical Colloquium in Utrecht. (01.11.2001)

Analytic combinatorics and proof theory. Eingeladener Vortrag, Logikseminar der Technischen Universität Wien (13.08.2001).

Analytic combinatorics and proof theory. Vortrag, Logic Colloquium in Wien (08.08.2001).

Mathematical analysis of termination proofs. Workshop on termination in Utrecht. (21.05.2001)

Analytic Combinatorics and Proof Theory. Invited talk at the logic seminar in Utrecht. (18.05.2001)

Analytische Zahlentheorie und Beweistheorie. Invited talk at the logic seminar in Bielefeld. (15.12.2000)

Eine Anwendung analytischer Zahlentheorie in der Beweistheorie. Invited talk at the logic seminar in Hannover. (10.11.2000)

An independence result for $PA$ via graphical enumeration. Invited talk, Colloquium Logicum in Dresden (22.09.2000)

An independence result for first order Peano arithmetic via Polya style graphical enumeration. Talk at the DMV-Tagung in Dresden (21.09.2000)

Constructive aspects of Kruskal's theorem. Invited talk at the Japanese Advanced Institute of Science and Technology (05.06.2000).

Optimal bounds on the derivation lengths for Gödel's T. Invited talk at the Logic seminar of the Kyoto Sangyo University (03.05.2000).

An independence result for PA via graphical enumeration. Invited talk at the Logic seminar of the University of Kobe (29.05.2000).

Rapidly growing functions. Invited talk at the Logic seminar of the University of Hiroshima (25.05.2000).

Natural fundamental sequences. Invited talk at the Logic seminar of the TU Wien (22.11.1999).

Fundamental sequences and subrecursive hierarchies. Invited talk at the Collegium Logicum in Wien (20.11.1999).

Variations on the slow growing hierarchy. Invited talk at workshop on proof and computation in München (05.11.1999).

Applications of infinitary proof theory. Joint Lecture with W. Pohlers at the European Summer School of Logic, Language and Information in Utrecht (08.08.-20.08.1999).

Proof theory and subrecursive hierarchies. Invited plenary talk at the ASL Logic Colloquium in Utrecht (06.08.1999).

Beweisbar rekursive Funktionen und subrekursive Hierarchien. Eingeladener Vortrag im Seminar für Logik in Bonn (20.05.1999).

A slow growing analysis of the canonical rewrite system for the Ackermann function. Talk at the workshop on termination, Dagstuhl (11.05.1999).

Zum Vergleich der schnell und langsam wachsenden Hierarchie. Vortrag beim Symposium Foundations of the formal sciences, Berlin (07.05.1998).

Recent results on slow versus fast growing. Invited lecture at the proof theory workshop in Leeds (11.02.1999).

Some interesting properties of the slow growing hierarchy. Invited lecture at the logic seminar in Tokyo (19.10.1998).

Sharp bounds for the lengths of reduction sequences in Gödel's T. Invited lecture at the conference Symbolic Logic and Computer Science in Sendai (14.10.1998).

Proof-theoretic analyses of Kruskal's theorem. Invited lecture at the conference Meta-arithmetic and computation in Sendai (13.10.1998)

How is it that infinitary methods can be applied to finitary mathematics? Goedel's T, a case study. Castiglioncello (4.10.1998)

Term rewriting and Proof Theory. Two invited lectures at the Oberwolfach meeting on Logic (18.01-24.01.1998).

Rekursionstheorie und Termersetzungssysteme. Invited lecture at the technical university of Vienna (18.10-25.10.1997).

How is it that infinitary methods can be applied to finitary mathematics? Invited talk for the special session about proof theory at the Logic Colloquium 97 in Leeds.

A constructive proof of strong normalization for Gödel's T by a monotone interpretation. Talk at the workshop on termination (21.05.1997).

Nontrivial closure properties of primitive recursion Invited talk at the Technical University of Vienna (7.10.1996).

Recent results on subrecursive hierarchies Talk at the DMV-Meeting in Jena (16.09.1996).

How to characterize provably total functions by the Buchholz operator method Talk at Gödel 96 (29.08.1996).

How to characterize provably total functions by the Buchholz operator method Talk at the Symposium on Types and Ordinal Notation Systems in Uppsala (11.04.1996).

Term rewriting techniques in proof and recursion theory Invited talk for the special session about proof theory at the Logic Colloquium in Haifa (11.08.1995).

Constructive aspects of Kruskal's theorem Invited talk at the University of Utrecht (22.11.1995).

Nontrivial closure properties of primitive recursion Invited talk at the University of Amsterdam (24.11.1995).

Subrecursive hierarchies in logic and computer science. Talk at the Oberwolfach meeting on mathematical logic (07.04.1995).

Term rewriting techniques in proof and recursion theory Invited talk at the University of Stanford (24.02.1995).

A tutorial on Kruskal's theorem and well partial orders. Six lectures given at INRIA in Nancy (1994-1995).

Hauptfolgen und subrekursive Hierarchien. Invited talk at the Oberseminar of the University of Heidelberg (1994).

Termination proofs with lexicographic path orderings imply multiply recursive derivation lengths. Invited talk at INRIA in Nancy (15.09.1993).

A constructive proof of Kruskal's theorem. Invited talk at INRIA in Nancy (06.07.1992).