On uniform definability of types over finite sets
- 1 June 2012
- journal article
- Published by Cambridge University Press (CUP) in The Journal of Symbolic Logic
- Vol. 77 (2) , 499-514
Abstract
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.Keywords
All Related Versions
This publication has 1 reference indexed in Scilit:
- Compression Schemes, Stable Definable Families, and o-Minimal StructuresDiscrete & Computational Geometry, 2009