|کد مقاله||کد نشریه||سال انتشار||مقاله انگلیسی||ترجمه فارسی||نسخه تمام متن|
|4661559||1413704||2017||42 صفحه PDF||ندارد||دانلود کنید|
The main result of this paper is a positive answer to the Conjecture 5.1 of  by A. Chernikov, I. Kaplan and P. Simon: If M is a PRC field, then Th(M)Th(M) is NTP2 if and only if M is bounded. In the case of PpC fields, we prove that if M is a bounded Pp C field, then Th(M)Th(M) is NTP2. We also generalize this result to obtain that, if M is a bounded PRC or PpC field with exactly n orders or p -adic valuations respectively, then Th(M)Th(M) is strong of burden n. This also allows us to explicitly compute the burden of types, and to describe forking.
Journal: Annals of Pure and Applied Logic - Volume 168, Issue 1, January 2017, Pages 191–232