Forking and Incomplete Types
Tapani Hyttinen · Mathematical logic quarterly · 1996
Abstract Let Δ be a set of formulas. In this paper we study the following question: under what assumptions on Δ, the concept “a complete Δ‐type p over B does not fork over A ⊆ B” behaves well. We apply the results to the structure theory of ω1‐saturated models. Mathematics Subject Classification: 03C45.