Prof. Dr. Andreas Weiermann

Institut für Mathematische Logik und Grundlagenforschung

der Westfälischen-Wilhelms Universität Münster

Einsteinstr. 62

D-48149 Münster

e-mail: weierma(at)math(dot)uni(hyphen)muenster.de

phone: (X49)251-8333762

phone: (X49)251-8333762

(X49)251-8333790 (secretary of the Institute)

(X49)251-8333060 (secretary of the Institute)

(X49)251-8333078 (fax)

Address in Utrecht:

Institut for Wiskunde en Informatica

Budapestlaan 6

3548 Utrecht

email: weierman(at)math(dot)uu.nl

Homepage in Utrecht

The information on this page is representative till the end of 2003. For recent information please consult my Utrecht homepage. Utrecht is a place which provides a very nice competitive scientific environment for high quality research in logic in general (and proof theory in particular) and mathematics. I am still a Heisenberg fellow of the DFG. The Deutsche Forschungsgemeinschaft has supported my research in addition by sponsoring a two years project for Gye Sik Lee and a two years project for Ingo Lepper. Moreover I am scientist in charge for a Marie Curie fellowship of Georg Moser. Recently the DFG has funded a joint project with Alan Woods about analytic combinatorics and logical limit laws and a joint project with Harvey Friedman and Toshiyasi Arai about the fine structure of independence results. From 1.9.1994-31.3.1995 I was sponsored by a HCM-grant from the European Community. From 1985-88 I was Stipendiat of the Studienstiftung des Deutschen Volkes.

PC member LC 2002. OC member LC 2002. PC member WST 2003.

For recent information please consult my Utrecht pages.

- Vita, (in german)
- List of Publications (in german)
- Ein neuer Zugang zu Kollabierungsfunktionen. (Dissertation, Münster 1990)
- Ein Beitrag zur Theorie der subrekursiven Funktionen (Habilitationsschrift, Münster 1994)

Recent information can be found
on my Utrecht homepage.
The information concerning my research found in the
Forschungsbericht 2003-2004 of the University of Muenster
seems a bit incomplete.
To complement it let us add
that AMS Reviews gives the following information on the number
of relevant publications:

2001-2002 Schindler:5 Pohlers:0 Diller:1 Weiermann:4

2003-2004 Schindler:6 Pohlers:0 Diller:0 Weiermann:5

Some of my recent papers combine enumerative
combinatoric and analytical methods
with proof theory. I obtained
optimal Friedman style classifications
for slowly descending sequences of ordinals less
than $\epsilon_0$ and for slowly
well partially ordered sequences of finite
trees.
The first paper (now revised and to appear in the Journal of Symbolic Logic) is:
An application of graphical enumeration to PA
.
Some further papers on this material are
in preparation. These will use Tauberian theorems
and methods from probability
theory and complex analysis. A recent
example is about
binary trees
(to appear in Mathematical Logic Quarterly).
Moreover I obtained complete classifications for the
Paris
Harrington
result (to appear in the Proceedings of the AMS), the Goodstein sequences and the Hydra game.
Some of these results have been presented
at the seminars on the average case analysis
in
Tatihou
and
Strobl
.
A recent result on a logical limit law characterization
of the proof-theoretic ordinal of Peano arithmetic has been presented at
a colloquium on Algorithms, Trees, Combinatorics and
Probabilities in
Versailles.
Quite recently I submitted a preprint about an application of the
Riemann
hypothesis
and the
ABC conjecture
to independence results
for publication.
Some problems on natural well orders which I found
interesting are contained in the following selection of
problems on natural wellorders.
Some mathematical problems which arose from logic
can be found in this
list
.

I have published three chess problems in a refereed chess journal.

- A mate in two moves See also: http://www.muenster.org/sk32/sk32prbl.htm#Weiermann
- A mate in two moves
- A selfmate in two moves

(Impredicative) proof-theory, ordinal notation systems, well-quasi-orderings, Kruskal theorems, termination proofs for rewrite systems, Pi^1_2-logic, subrecursive hierarchies, provably recursive functions, functionals of finite type, predicative recursion, analytic number theory, asymptotic analysis, average case analysis of algorithms, analytic number theory.

I have supervised the
Diplomarbeit of B. Blankertz, the Diplomarbeiten of
Volker Hartung (in part),
Michael Möllerfeld and Stefan Kumbier and a part of
the
Diplomarbeit of Wolfgang Burr. (Parts of the diploma thesis
of Blankertz thesis have led to a joint publication
in Studia Logica. Parts of the diploma thesis of
Hartung have led to a publication in Archive for Mathematical
Logic. Burr's Diplomarbeit has
won a price at the Studentenkonferenz in Jena 1996.)
In 1998 I have supervised the Diplomarbeiten
of Stefan Harmeling and Gunnar Wilken.

Further diploma projects which I can offer
arise from problems which have been left open
in my publications. At the moment I can offer
some projects which deal with growth
rate classifactions of the slow growing
hierarchy. Moreover I can offer problems
about applying analytic number theory to proof
theory. These problems result from recent research.
With some assistence it should
be possible to solve these problems in about half a year.
Alternatively a student may work out detailed versions
of articles in the area of classical proof theory,
higher recursion theory or set theory.

and now I visit regularly the chess club Paul Keres in Utrecht. A nice chess link is the following.

I also like painting and paintings (e.g expressionistic ones a la van Gogh , Nolde, etc .).

Recently I also got interest in the Dutch language and literature.

H.-Doz. Dr. Andreas Weiermann (weierma@math.uni-muenster.de)