Hostname: page-component-7b7567c8c-z4zkx Total loading time: 0 Render date: 2026-11-17T04:04:24.517Z Has data issue: false hasContentIssue false

Simplicity, and stability in there

Published online by Cambridge University Press:  12 March 2014

Byunghan Kim*
Affiliation:
Department of Mathematics, 2-171, Massachusetts Institute of Technology, Cambridge, Massachusetts 02139., USA, E-mail: bkim@math.mit.edu

Abstract

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 is the union of names of ψ-definitions of , ψ ranging over stationary L-formulas in . 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.

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 2001

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable