Logic Seminar
Chris Laskowski
University of Maryland
Compression schemes and definability of types
Abstract: We begin by discussing notions of compressions
occurring in computational learning theory and relate these
to the definability of types. We offer an improvement to
Shelah's theorem for stable formulas and investigate the conjecture
that dependent formulas have uniform type definitions over finite
sets.
Parts of this are joint with Hunter Johnson and Vince Guingona.
seminar begins with tea.
Tuesday April 21, 2009 at 4:00 PM in SEO 612