Vincent Guingona : Definability of types and compression schemes

Posted by , part of the Logic Seminar.

At

Feb. 1, 2011, 3 p.m.

In

SEO 612

Abstract

In this talk, we discuss compression schemes and how they relate to the model-theoretic notion of definability of types. This motivates our definition of uniform definability of types over finite sets (UDTFS), which is a generalization of the standard definability of types in stable theories. We show that dp-minimal theories have UDTFS and discuss how this impacts compression schemes. Finally, we discuss the notion of UDTFS rank and show how it relates to VC-density and the dimension of a compression scheme.

Logic tea from 2:15pm-3:00pm in SEO 300.