Lectures

Last updated: 07.01.2007

Back to preprints
Back to Homepage

Slides

  1. NEW: From Hilbert's Program to a Logic Tollbox Slides
    Invited lecture at LPAR07, Yerevan, October 2007.
  2. Why is the chromatic polynomial a polynomial? Slides:
    Colloquium and Seminar lecture given in Jerusalem, Budapest, Zurich and Tel Aviv (November 2006- January 2007)
  3. Bombay Lecture: The spectrum problem and Parikh's theorem.
    For R. Parikh's 70th birthday. Slides:
    Second Indian conference on logic and its relationship with other disciplines
    January 9-11, 2007, IIT Bombay
  4. Epit05: Lectures on Logic and Combinatorics, Slides presented at EPIT 2005 , Montagnac-les-Truffes, Provence, France, May 2005.
  5. SAT Lecture, DM'04 and Toronto CS Colloquium, June 2004
    Counting satisfying assignments of formulas of bounded tree or clique width. Slides:
  6. Kalmar03 Lecture, October 2003
    50 Years of the Spectrum Problem, Slides:
  7. Arcachon Lecture, May 2002
    BCNF revisited: 30 Years Database Normal Forms, Slides in ps: Slides in pdf:
  8. BRICS Lectures, July 2001
    Logical Methods in Algorithmics and Complexity

    Lecture 1: Definability and computability
    Lecture 2: Back and forth methods and the Feferman-Vaught theorem
    Lecture 3: Inductive classes of structures
    Lecture 4: Graph polynomials and their complexity
    Lecture 5: Applications to knot theory

  9. Tarski Centenary Lecture, Warsaw, June 2001 slides
    Algorithmic uses of the Feferman-Vaught theorem

  10. Bordeaux Lectures, October 2000
    Logical Methods in Algorithmics and Complexity prepared by J.A. Makowsky
    Lecture 1: Definability and Descriptive Complexity
    Lecture 2: Graph Polynomials and Knot Theory
    Lecture 3: What is so Special about Monadic Second Order Logic?

  11. ESSLLI'99 Lectures, Utrecht, August 1999:
    Logical Methods in Combinatorial Algorithms, prepared by J.A. Makowsky
    Complete set of Slides of a series of lectures on the application of clique width and tree width towards optimization and enumeration problems.

  12. ESSLLI'97 Lectures, Aix-en-Provence, France, August 12-22, 1997
    Translations, Interpretations and Reductions by J.A. Makowsky (assisted by E. Ravve),
    Abstract: We define translation schemes and their induced maps, transductions and translations, in various logics and show how they are used in various parts of mathematical logic such as (un-)decidability, (un-)definability, descriptive complexity, and database design.
    Prelude ,
    Lecture 1: Concepts and their Representations ,
    Lecture 2: Translation Schemes ,
    Lecture 3: (Un-)decidability ,
    Lecture 4: (Un-)definability ,
    Lecture 5: Descriptive Complexity ,
    Lecture 6: Database Design