Around stable forking
Fundamenta Mathematicae, Tome 170 (2001) no. 1, pp. 107-118
Voir la notice de l'article provenant de la source Institute of Mathematics Polish Academy of Sciences
We discuss various conjectures and problems around the issue
of when and whether stable formulas are responsible for forking
in simple theories. We prove that if the simple theory $T$ has
strong stable forking then any
complete type is a nonforking extension of a complete type which
is axiomatized by instances of stable formulas. We also give
another treatment of the first author's result which identifies
canonical bases in supersimple theories.
Keywords:
discuss various conjectures problems around issue whether stable formulas responsible forking simple theories prove simple theory has strong stable forking complete type nonforking extension complete type which axiomatized instances stable formulas another treatment first authors result which identifies canonical bases supersimple theories
Affiliations des auteurs :
Byunghan Kim 1 ; A. Pillay 2
@article{10_4064_fm170_1_6,
author = {Byunghan Kim and A. Pillay},
title = {Around stable forking},
journal = {Fundamenta Mathematicae},
pages = {107--118},
publisher = {mathdoc},
volume = {170},
number = {1},
year = {2001},
doi = {10.4064/fm170-1-6},
language = {en},
url = {http://geodesic.mathdoc.fr/articles/10.4064/fm170-1-6/}
}
Byunghan Kim; A. Pillay. Around stable forking. Fundamenta Mathematicae, Tome 170 (2001) no. 1, pp. 107-118. doi: 10.4064/fm170-1-6
Cité par Sources :