On uniform definability of types over finite sets
In this paper, using definability of types over indiscernible sequences as a template, we study a property of formulas and theories called “uniform definability of types over finite sets” (UDTFS). We explore UDTFS and show how it relates to well-known properties in model theory. We recall that stable theories and weakly o-minimal theories have UDTFS and UDTFS implies dependence. We then show that all dp-minimal theories have UDTFS.
Permanent link to this document: http://projecteuclid.org/euclid.jsl/1333566634
Digital Object Identifier: doi:10.2178/jsl/1333566634
Zentralblatt MATH identifier: 06047773
Mathematical Reviews number (MathSciNet): MR2963018