Forking in NTP₂ theories
classification
🧮 math.LO
keywords
theoriesforkingapplicationassumingbaseboundeddependencedependent
read the original abstract
We prove that in theories without the tree property of the second kind (which include dependent and simple theories) forking and dividing over models are the same, and in fact over any extension base. As an application we show that dependence is equivalent to bounded non-forking assuming NTP_2.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.