3.30 pm, Seminar Hall
CMI Silver Jubilee Lecture
Basics of WQO theory, with some applications in computer science
CNRS and ENS Cachan.
Well-quasi-orderings (WQOs) are a fundamental tool in logic, graph theory, combinatorics, computer science, ... In computer science, they provide termination arguments in a large number of decidability (or finiteness, regularity, ...) results. In these applications, WQOs usually appear under the guise of specific tools, like Dicksonâs Lemma (for tuples of natural numbers), Higmanâs Lemma (for sequences), Kruskalâs Tree Theorem and its variants (for finite trees with embeddings), and recently the Robertson-Seymour Theorem (for graphs and their minors).
The lecture will recall in a gentle way the most basic notions and results of WQO theory, and describe some applications or open problems that come from a computer science perspective.