SOP1, SOP2, and antichain tree property

IF 0.6 2区 数学 Q2 LOGIC Annals of Pure and Applied Logic Pub Date : 2023-12-11 DOI:10.1016/j.apal.2023.103402
JinHoo Ahn , Joonhee Kim
{"title":"SOP1, SOP2, and antichain tree property","authors":"JinHoo Ahn ,&nbsp;Joonhee Kim","doi":"10.1016/j.apal.2023.103402","DOIUrl":null,"url":null,"abstract":"<div><p>In this paper, we study some tree properties and their related indiscernibilities. First, we prove that SOP<sub>2</sub> can be witnessed by a formula with a tree of tuples holding ‘arbitrary homogeneous inconsistency’ (e.g., weak <em>k</em>-TP<sub>1</sub> conditions or other possible inconsistency configurations).</p><p>And we introduce a notion of tree-indiscernibility, which preserves witnesses of SOP<sub>1</sub>, and by using this, we investigate the problem of (in)equality of SOP<sub>1</sub> and SOP<sub>2</sub>.</p><p>Assuming the existence of a formula having SOP<sub>1</sub> such that no finite conjunction of it has SOP<sub>2</sub><span>, we observe that the formula must witness some tree-property-like phenomenon, which we will call the antichain tree property (ATP, see </span><span>Definition 4.1</span>). We show that ATP implies SOP<sub>1</sub> and TP<sub>2</sub>, but the converse of each implication does not hold. So the class of NATP theories (theories without ATP) contains the class of NSOP<sub>1</sub> theories and the class of NTP<sub>2</sub> theories.</p><p>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 SOP<sub>2</sub>. So this example shows that SOP<sub>1</sub> and SOP<sub>2</sub> are not the same at the level of formulas, i.e., there is a formula having SOP<sub>1</sub>, while any finite conjunction of it does not witness SOP<sub>2</sub> (but a variation of the formula still has SOP<sub>2</sub>).</p></div>","PeriodicalId":50762,"journal":{"name":"Annals of Pure and Applied Logic","volume":null,"pages":null},"PeriodicalIF":0.6000,"publicationDate":"2023-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Annals of Pure and Applied Logic","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0168007223001598","RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"LOGIC","Score":null,"Total":0}
引用次数: 0

Abstract

In this paper, we study some tree properties and their related indiscernibilities. First, we prove that SOP2 can be witnessed by a formula with a tree of tuples holding ‘arbitrary homogeneous inconsistency’ (e.g., weak k-TP1 conditions or other possible inconsistency configurations).

And we introduce a notion of tree-indiscernibility, which preserves witnesses of SOP1, and by using this, we investigate the problem of (in)equality of SOP1 and SOP2.

Assuming the existence of a formula having SOP1 such that no finite conjunction of it has SOP2, 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 and TP2, but the converse of each implication does not hold. So the class of NATP theories (theories without ATP) contains the class of NSOP1 theories and the class of NTP2 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. So this example shows that SOP1 and SOP2 are not the same at the level of formulas, i.e., there is a formula having SOP1, while any finite conjunction of it does not witness SOP2 (but a variation of the formula still has SOP2).

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
SOP1、SOP2 和反链树特性
本文研究了一些树属性及其相关的不可辨性。首先,我们证明了 SOP2 可以由具有 "任意同质不一致性"(如弱 k-TP1 条件或其他可能的不一致性配置)的元组树公式来证明、假定存在一个具有 SOP1 的公式,而它的任何有限连接都不具有 SOP2,我们就会发现这个公式必须具有某种类似树属性的现象,我们称之为反链树属性(ATP,见定义 4.1)。我们证明 ATP 蕴涵 SOP1 和 TP2,但每个蕴涵的反义词都不成立。因此,NATP 理论类(不含 ATP 的理论)包含了 NSOP1 理论类和 NTP2 理论类。在本文的最后,我们构造了一个结构,它的理论有一个具有 ATP 的公式,但该公式的任何连接词都不具有 SOP2。因此,这个例子说明,在公式的层面上,SOP1 和 SOP2 是不一样的,也就是说,有一个公式具有 SOP1,而它的任何有限联结都不具有 SOP2(但该公式的变体仍然具有 SOP2)。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
CiteScore
1.40
自引率
12.50%
发文量
78
审稿时长
200 days
期刊介绍: The journal Annals of Pure and Applied Logic publishes high quality papers in all areas of mathematical logic as well as applications of logic in mathematics, in theoretical computer science and in other related disciplines. All submissions to the journal should be mathematically correct, well written (preferably in English)and contain relevant new results that are of significant interest to a substantial number of logicians. The journal also considers submissions that are somewhat too long to be published by other journals while being too short to form a separate memoir provided that they are of particular outstanding quality and broad interest. In addition, Annals of Pure and Applied Logic occasionally publishes special issues of selected papers from well-chosen conferences in pure and applied logic.
期刊最新文献
Dividing and forking in random hypergraphs Editorial Board Saturation properties for compositional truth with propositional correctness Foundations of iterated star maps and their use in combinatorics Theories of Frege structure equivalent to Feferman's system T0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1