arXiv Analytics

Sign in

arXiv:1005.4924 [math.LO]AbstractReferencesReviewsResources

On uniform definability of types over finite sets

Vincent Guingona

Published 2010-05-26Version 1

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.

Comments: 17 pages, 0 figures
Categories: math.LO
Subjects: 03C45
Related articles: Most relevant | Search more
arXiv:1904.10336 [math.LO] (Published 2019-04-23)
On uniform definability of types over finite sets for NIP formulas
arXiv:1407.0222 [math.LO] (Published 2014-07-01)
On forking and definability of types in some dp-minimal theories
arXiv:1108.2499 [math.LO] (Published 2011-08-11)
Definability of types over finite partial order indiscernibles

Links

Toolbox