On uniform definability of types over finite sets

Details On uniform definability of types over finite sets On uniform definability of types over finite sets

2010-05-26

arxiv.org/abs/1005.4924v1

Mathematics

Logic

17 pages, 0 figures

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

On uniform definability of types over finite sets does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On uniform definability of types over finite sets, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On uniform definability of types over finite sets will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-607550