Chris Laskowski : Compression schemes and definability of types

Posted by , part of the Logic Seminar.

At

April 21, 2009, 4 p.m.

In

SEO 612

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.