Title: Logical aspects of graph polynomials

Abstract:
We first discuss graph polynomials from a logical point of view by
looking at the classical examples: the chromatic polynomial, the
matching polynomials, the characteristic polynomial and the Tutte
polynomial. Then we introduce the class of graph polynomials
which are definable in second order logic and some of its fragments and
outline a complexity theory for their computability.

The talk does not require any prerequisites on graph polynomials
or logic besides the most elementary.