APOLOGIES - this seminar is cancelled.
Professor Terry Lyons will talk instead on signed probability measures and some old results of Krylov.
By classical results of Tarski and Artin-Schreier, the elementary theory of the field of real numbers can be axiomatized in purely Galois-theoretic terms by describing the absolute Galois group of the field. Using work of Ax-Kochen/Ershov and a p-adic analogue of the Artin-Schreier theory the same can be proved for the field $\mathbb{Q}_p$ of p-adic numbers and for very few other fields.
Replacing, however, the absolute Galois group of a field K by that of the rational function field $K(t)$ over $K$, one obtains a Galois-theoretic axiomatiozation of almost arbitrary perfect fields. This gives rise to a new approach to longstanding decidability questions for fields like
$F_p((t))$ or $C(t)$.
Hypergraph Transversals have been studied in Mathematics for a long time (e.g. by Berge) . Generating minimal transversals of a hypergraph is an important problem which has many applications in Computer Science, especially in database Theory, Logic, and AI. We give a survey of various applications and review some recent results on the complexity of computing all minimal transversals of a given hypergraph.