Forking and dividing in ntp 2 theories

Artem Chernikov; Itay Kaplan

doi:10.2178/jsl/1327068688

Forking and dividing in ntp ₂ theories

Artem Chernikov^*, Itay Kaplan

^*Corresponding author for this work

Research output: Contribution to journal › Article › peer-review

46 Scopus citations

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

Original language	English
Pages (from-to)	1-20
Number of pages	20
Journal	Journal of Symbolic Logic
Volume	77
Issue number	1
DOIs	https://doi.org/10.2178/jsl/1327068688
State	Published - Mar 2012
Externally published	Yes

Access to Document

10.2178/jsl/1327068688

Cite this

@article{faf56ae527c64c8c87cf1c62391b2983,

title = "Forking and dividing in ntp 2 theories",

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.",

author = "Artem Chernikov and Itay Kaplan",

year = "2012",

month = mar,

doi = "10.2178/jsl/1327068688",

language = "אנגלית",

volume = "77",

pages = "1--20",

journal = "Journal of Symbolic Logic",

issn = "0022-4812",

publisher = "Cambridge University Press",

number = "1",

}

TY - JOUR

T1 - Forking and dividing in ntp 2 theories

AU - Chernikov, Artem

AU - Kaplan, Itay

PY - 2012/3

Y1 - 2012/3

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

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

UR - http://www.scopus.com/inward/record.url?scp=84860174111&partnerID=8YFLogxK

U2 - 10.2178/jsl/1327068688

DO - 10.2178/jsl/1327068688

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:84860174111

SN - 0022-4812

VL - 77

SP - 1

EP - 20

JO - Journal of Symbolic Logic

JF - Journal of Symbolic Logic

IS - 1

ER -

Forking and dividing in ntp ₂ theories

Abstract

Access to Document

Other files and links

Fingerprint

Cite this