Simplicity, and Stability in There
Kim, Byunghan
J. Symbolic Logic, Tome 66 (2001) no. 1, p. 822-836 / Harvested from Project Euclid
Firstly, in this paper, we prove that the equivalence of simplicity and the symmetry of forking. Secondly, we attempt to recover definability part of stability theory to simplicity theory. In particular, using elimination of hyperimaginaries we prove that for any supersimple T, canonical base of an amalgamation class $\mathscr{P}$ is the union of names of $\psi$-definitions of $\mathscr{P}, \psi$ ranging over stationary L-formulas in $\mathscr{P}$. Also, we prove that the same is true with stable formulas for an 1-based theory having elimination of hyperimaginaries. For such a theory, the stable forking property holds, too.
Publié le : 2001-06-14
Classification: 
@article{1183746476,
     author = {Kim, Byunghan},
     title = {Simplicity, and Stability in There},
     journal = {J. Symbolic Logic},
     volume = {66},
     number = {1},
     year = {2001},
     pages = { 822-836},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1183746476}
}
Kim, Byunghan. Simplicity, and Stability in There. J. Symbolic Logic, Tome 66 (2001) no. 1, pp.  822-836. http://gdmltest.u-ga.fr/item/1183746476/