Abstract
Let T be a simple L-theory and let T- be a reduct of T to a sublanguage L- of L. For variables x, we call an ∅ -invariant set Γ (x) in C a universal transducer if for every formula ϕ-(x, y) ∈ L- and every a, ϕ-(x,a)L--forksover∅iffΓ(x)∧ϕ-(x,a)L-forksover∅.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-) for all y. 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. If T- is a theory with the wnfcp (the weak nfcp) and T is the theory of its lovely pairs of models we show that Γ ~ x= (x= x) and give a more precise description of the set of universal transducers for the special case where T- has the nfcp.
| Original language | English |
|---|---|
| Pages (from-to) | 313-324 |
| Number of pages | 12 |
| Journal | Archive for Mathematical Logic |
| Volume | 59 |
| Issue number | 3-4 |
| DOIs | |
| State | Published - 1 May 2020 |
Keywords
- Forking topology
- Reduct
- Universal transducer
Fingerprint
Dive into the research topics of 'On the forking topology of a reduct of a simple theory'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver