Lynn Scow : Tree indiscernibles

Posted by , part of the Logic Seminar.

At

Nov. 29, 2011, 4 p.m.

In

SEO 427

Abstract

I will present on indiscernible trees and their applications. I say that a collection of parameters forms an indiscernible tree if, indexed by a structure that has a reduct to a partial tree order, it behaves like a general kind of indiscernible sequence. Certain properties of first-order theories, such as the tree property, behave well under taking certain indiscernible trees and not others. We will discuss these sorts of problems.

Tea at 3:30pm in SEO300