Logic Seminar
Maryanthe Malliaris
UChicago
Independence and order in the characteristic sequence.
Abstract: The characteristic sequence of hypergraphs $\langle P_n : n<\omega
\rangle$ associated to a formula $\phi(x;y)$, defined by $P_n(y_1,\ldots
y_n) = (\exists x) \bigwedge_{i\leq n} \phi(x;y_i)$, is a tool for
studying the combinatorial complexity of $\phi$-types. This talk will
discuss how graph-theoretic techniques, notably Szemeredi regularity,
can be naturally applied to the study of model-theoretic complexity via
the characteristic sequence.
seminar begins with tea
Tuesday September 1, 2009 at 4:00 PM in SEO 612