Graduate studies at Western
Journal of Symbolic Logic 66 (2):822-836 (2001)
|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|
|Keywords||No keywords specified (fix it)|
|Categories||categorize this paper)|
|Through your library||Configure|
Similar books and articles
Samuel A. Richmond (1996). A Simplification of the Theory of Simplicity. Synthese 107 (3):373 - 393.
Wlodzimierz Rabinowicz (1989). Stable and Retrievable Options. Philosophy of Science 56 (4):624-641.
Arnold Zellner, Hugo A. Keuzenkamp & Michael McAleer (eds.) (2001). Simplicity, Inference and Modeling: Keeping It Sophisticatedly Simple. Cambridge University Press.
Peter Turney (1990). The Curve Fitting Problem: A Solution. British Journal for the Philosophy of Science 41 (4):509-530.
James W. McAllister (1991). The Simplicity of Theories: Its Degree and Form. [REVIEW] Journal for General Philosophy of Science 22 (1):1-14.
Aaron Sloman, Simplicity and Ontologies The Trade-Off Between Simplicity of Theories and Sophistication of Ontologies.
Byunghan Kim & Anand Pillay (1998). From Stability to Simplicity. Bulletin of Symbolic Logic 4 (1):17-36.
Alf Onshuus (2006). Properties and Consequences of Thorn-Independence. Journal of Symbolic Logic 71 (1):1 - 21.
Added to index2009-01-28
Total downloads3 ( #214,631 of 751,836 )
Recent downloads (6 months)0
How can I increase my downloads?