Definability of types over finite partial order indiscernibles
Logic
2011-08-12 v1
Abstract
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.
Keywords
Cite
@article{arxiv.1108.2499,
title = {Definability of types over finite partial order indiscernibles},
author = {Vincent Guingona},
journal= {arXiv preprint arXiv:1108.2499},
year = {2011}
}
Comments
25 pages