2009/06/15 by Artem Chernikov, Pierre Simon, Chernikov, Artem +1
Computer Science · Mathematics · #Computability, Logic, AI Algorithms #semigroups and automata theory #Advanced Topology and Set Theory
paper · pdf · doi:10.48550/arxiv.0906.2708
In this short note we show that if we add predicate for a dense complete indiscernible sequence in a dependent theory then the result is still dependent. This answers a question of Baldwin and Benedikt and implies that every unstable dependent theory has a dependent expansion interpreting linear order.