• SS12: Logic and Discrete Structures
• WS11/12: Analysis I for students of Computer Science and Statistics
• WS10/11: Geometry
• SS10: Mathematical Logic II
• WS09/10: Linear Algebra for students of Computer Science and Statistics
• SS09: Synthetic und analytic treatment of geometric problems
• WS08/09: Differential and Integral Calculus III
• SS08 Complex Analysis (Funktionentheorie) (ss08_ft.rar, 2.5MB)
• SS07: Mathematical Logic II (ss07_mlii.rar, 390KB)
• SS05: Linear Algebra II

• Towards a Formal Theory of Computability (preprint)
  Joint work with S. Huber and H. Schwichtenberg, in Ways of Proof Theory (Pohler's Festschrift)
  A Case Study (slides)
  Arbeitstagung Bern-München 2010
• Plotkin Definability Theorem for Atomic-Coherent Information Systems (slides)
  Computability in Europe 2008
• Normal Form of Finite Algebraic Approximations
  Seminar on Proof Theory WS 2006/7
• Elaborating on Ishihara's 'WKL implies FAN'
  EST training workshop 2005
• Tree Fractions and the Critical Pair Lemma
  Untergrundseminar 2005
• Graph Reductions (in greek)
  MSc thesis, A.U.Th. 2004
  Graph Reductions & Musical Styles (handout)
  L.M.U. 2004

• Stephen Strogatz' New York Times Blog
• Mathematics and Computation, Andrej Bauer's very interesting blog
• Answers to frequently asked questions about Constructive Mathematics, by Douglas Bridges
• Of pi's and fetishists: Michael Hartl taking on π versus 2π.
• Richard Elwes' Simple City
• PhD Comics, the must link on every Ph.D.'s webpage

Last modified: 15.05.2012