Let be simple and a reduct of . For variables , we call an -invariant set of with the property that for every formula : for every , -forks over iff -forks over , a \em universal transducer\em. We show that there is a greatest universal transducer (for any ) and it is type-definable. In particular, the forking topology on refines the forking topology on . Moreover, we describe the set of universal transducers in terms of certain topology on the Stone space and show that is the unique universal transducer that is -type-definable with parameters. In the case where is a theory with the wnfcp (the weak nfcp) and is the theory of its lovely pairs we show and give a more precise description of all its universal transducers in case has the nfcp.

生成讲解博客的中文版本

生成AI智能校验的中文版本