Abstract
We use the construction of an independence relation to prove that þ-forking is equivalent to forking of a stable formula (in the sense of st-forking, see Definition 1.3) in all theories, and to show that from þ-dividing one can always achieve strong dividing over a base which is in the definable closure of the parameter set. © 2016. Acad. Colomb. Cienc. Ex. Fis. Nat. All rights reserved.References
Adler, H. (2009). A geometric introduction to forking and thorn-forking. J. Math. Log., 9(1):1–20.
Ealy, C. (2004). Thorn Forking in Simple Theories and a Manin-Mumford Theorem for T-Modules. Thesis (Ph.D.)–University of California, Berkeley.
Kim, B. (2001). Simplicity, and stability in there. J. Symbolic Logic, 66(2):822–836.
Kim, B. and Pillay, A. (1997). Simple theories. Ann. Pure Appl. Logic, 88(2-3):149–164. Joint AILA-KGS Model Theory Meeting (Florence, 1995).
Kim, B. and Pillay, A. (2001). Around stable forking. Fund. Math., 170(1-2):107–118. Dedicated to the memory of Jerzy Ło´s.
Morley, M. (1965). Categoricity in power. Trans. Amer. Math. Soc., 114:514–538.
Onshuus, A. (2002). Thorn-forking in rosy theories. Pro Quest LLC, Ann Arbor, MI. Thesis (Ph.D.)–University of California, Berkeley.
Onshuus, A. (2006). Properties and consequences of thorn-independence. J. Symbolic Logic, 71(1):1–21.
Palacín, D. and Wagner, F. O. (2013). Elimination of hyperimaginaries and stable independence in simple CMtrivial theories. Notre Dame J. Form. Log.,54(3-4):541–551.
Shelah, S. (1990). Classification theory and the number of nonisomorphic models, volume 92 of Studies in Logic and the Foundations of Mathematics. North-Holland Publishing Co., Amsterdam, second edition.
This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.
Copyright (c) 2016 Journal of the Colombian Academy of Exact, Physical and Natural Sciences