Papers
Topics
Authors
Recent
Search
2000 character limit reached

SOP1_1, SOP2_2, and antichain tree property

Published 23 Mar 2020 in math.LO | (2003.10030v5)

Abstract: In this paper, we study some tree properties and their related indiscernibilities. First, we prove that SOP2_2 can be witnessed by a formula with a tree of tuples holding 'arbitrary homogeneous inconsistency' (e.g., weak k-TP1_1 conditions or other possible inconsistency configurations). And we introduce a notion of tree-indiscernibility, which preserves witnesses of SOP1_1, and by using this, we investigate the problem of (in)equality of SOP1_1 and SOP2_2. Assuming the existence of a formula having SOP1_1 such that no finite conjunction of it has SOP2_2, we observe that the formula must witness some tree-property-like phenomenon, which we will call the antichain tree property (ATP, see Definition 4.1). We show that ATP implies SOP1_1 and TP2_2, but the converse of each implication does not hold. So the class of NATP theories (theories without ATP) contains the class of NSOP1_1 theories and the class of NTP2_2 theories. At the end of the paper, we construct a structure whose theory has a formula having ATP, but any conjunction of the formula does not have SOP2_2. So this example shows that SOP1_1 and SOP2_2 are not the same at the level of formulas, i.e., there is a formula having SOP1_1, while any finite conjunction of it does not witness SOP2_2 (but a variation of the formula still has SOP2_2).

Authors (2)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.