Forking in simple unstable theories

71Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.

Abstract

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.

Cite

CITATION STYLE

APA

Kim, B. (1998). Forking in simple unstable theories. Journal of the London Mathematical Society, 57(2), 257–267. https://doi.org/10.1112/S0024610798005985

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free