On the forking topology of a reduct of a simple theory
Abstract
Let T be simple and T- a reduct of T. For variables x, we call an -invariant set (x) of C with the property that for every formula φ-(x,y)∈ L-: for every a, φ-(x,a) L--forks over iff (x) φ-(x,a) L-forks over , a universal transducer. We show that there is a greatest universal transducer x (for any x) and it is type-definable. In particular, the forking topology on Sy(T) refines the forking topology on Sy(T-). Moreover, we describe the set of universal transducers in terms of certain topology on the Stone space and show that x is the unique universal transducer that is L--type-definable with parameters. In the case where T- is a theory with the wnfcp (the weak nfcp) and T is the theory of its lovely pairs we show x=(x=x) and give a more precise description of all its universal transducers in case T- has the nfcp.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.