Journal of the London Mathematical Society · 1998 · 140 citations · 0 references
First Order TheoriesAlgebraic LogicStable TheoriesClassical LogicConcurrency TheoryModel TheoryHigher-order LogicFinite Model TheorySimple Unstable TheoriesSimple TheoriesStability
In [9], Shelah introduced a class of first order theories, which he called simple, properly containing the class of stable theories. Here we prove for simple theories, (i) the equivalence of forking and dividing, (ii) the symmetry and transivity of forking.