2000 character limit reached
Witnessing dp-rank
Published 27 Jan 2012 in math.LO | (1201.5799v2)
Abstract: We prove that in NTP_2 theories if p is a dependent type with dp-rank >= \kappa, then this can be witnessed by indiscernible sequences of tuples satisfying p. If p has dp-rank infinity, then this can be witnessed by singletons (in any theory).
Paper Prompts
Sign up for free to create and run prompts on this paper.
