Simplicity, and stability in there

Journal of Symbolic Logic 66 (2):822-836 (2001)
  Copy   BIBTEX

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 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

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,322

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

From stability to simplicity.Byunghan Kim & Anand Pillay - 1998 - Bulletin of Symbolic Logic 4 (1):17-36.
What is the problem of simplicity?Elliott Sober - 2001 - In Arnold Zellner, Hugo A. Keuzenkamp & Michael McAleer (eds.), Simplicity, Inference and Modelling: Keeping It Sophisticatedly Simple. New York: Cambridge University Press. pp. 13-32.
The simplicity of theories: Its degree and form. [REVIEW]James W. McAllister - 1991 - Journal for General Philosophy of Science / Zeitschrift für Allgemeine Wissenschaftstheorie 22 (1):1-14.
The curve fitting problem: A solution.Peter Turney - 1990 - British Journal for the Philosophy of Science 41 (4):509-530.
Stable and retrievable options.Wlodzimierz Rabinowicz - 1989 - Philosophy of Science 56 (4):624-641.
Properties and Consequences of Thorn-Independence.Alf Onshuus - 2006 - Journal of Symbolic Logic 71 (1):1 - 21.

Analytics

Added to PP
2009-01-28

Downloads
238 (#81,704)

6 months
14 (#170,850)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Theories without the tree property of the second kind.Artem Chernikov - 2014 - Annals of Pure and Applied Logic 165 (2):695-723.
On model-theoretic tree properties.Artem Chernikov & Nicholas Ramsey - 2016 - Journal of Mathematical Logic 16 (2):1650009.
A geometric introduction to forking and thorn-forking.Hans Adler - 2009 - Journal of Mathematical Logic 9 (1):1-20.
Independence over arbitrary sets in NSOP1 theories.Jan Dobrowolski, Byunghan Kim & Nicholas Ramsey - 2022 - Annals of Pure and Applied Logic 173 (2):103058.
Notions around tree property 1.Byunghan Kim & Hyeung-Joon Kim - 2011 - Annals of Pure and Applied Logic 162 (9):698-709.

View all 10 citations / Add more citations

References found in this work

Simple theories.Byunghan Kim & Anand Pillay - 1997 - Annals of Pure and Applied Logic 88 (2-3):149-164.
A note on Lascar strong types in simple theories.Byunghan Kim - 1998 - Journal of Symbolic Logic 63 (3):926-936.
From stability to simplicity.Byunghan Kim & Anand Pillay - 1998 - Bulletin of Symbolic Logic 4 (1):17-36.
Simple unstable theories.Saharon Shelah - 1980 - Annals of Mathematical Logic 19 (3):177.
A note on Lascar strong types in simple theories.Byunghan Kim - 1998 - Journal of Symbolic Logic 63 (3):926-936.

View all 6 references / Add more references