Simplicity, and stability in there

Journal of Symbolic Logic 66 (2):822-836 (2001)
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 P is the union of names of ψ-definitions of P, ψ ranging over stationary L-formulas in 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
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.2307/2695047
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history Request removal from index
Download options
PhilPapers Archive

Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 24,470
External links
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library
References found in this work BETA

No references found.

Add more references

Citations of this work BETA
Byunghan Kim & Hyeung-Joon Kim (2011). Notions Around Tree Property 1. Annals of Pure and Applied Logic 162 (9):698-709.
Alexei S. Kolesnikov (2005). N-Simple Theories. Annals of Pure and Applied Logic 131 (1-3):227-261.

Add more citations

Similar books and articles

Monthly downloads

Added to index


Total downloads

208 ( #17,229 of 1,925,544 )

Recent downloads (6 months)

2 ( #308,489 of 1,925,544 )

How can I increase my downloads?

My notes
Sign in to use this feature

Start a new thread
There  are no threads in this forum
Nothing in this forum yet.