Definability of types over finite partial order indiscernibles

Details Definability of types over finite partial order indiscernibles Definability of types over finite partial order indiscernibles

2011-08-11

arxiv.org/abs/1108.2499v1

Mathematics

Logic

25 pages

Scientific paper

In this paper, we show that a partitioned formula \phi is dependent if and
only if \phi has uniform definability of types over finite partial order
indiscernibles. This generalizes our result from a previous paper [1]. We show
this by giving a decomposition of the truth values of an externally definable
formula on a finite partial order indiscernible.

Affiliated with

Also associated with

No associations

Rating

Definability of types over finite partial order indiscernibles 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 Definability of types over finite partial order indiscernibles, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Definability of types over finite partial order indiscernibles will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-276787