Definability of types over finite partial order indiscernibles
classification
🧮 math.LO
keywords
finiteorderpartialdefinabilityformulaindiscerniblestypesdecomposition
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.