Decidability of Well Quasi-Order and Atomicity for Equivalence Relations Under Embedding Orderings

Order Pub Date : 2024-02-14 DOI:10.1007/s11083-024-09659-9
{"title":"Decidability of Well Quasi-Order and Atomicity for Equivalence Relations Under Embedding Orderings","authors":"","doi":"10.1007/s11083-024-09659-9","DOIUrl":null,"url":null,"abstract":"<h3>Abstract</h3> <p>We consider the posets of equivalence relations on finite sets under the standard embedding ordering and under the consecutive embedding ordering. In the latter case, the relations are also assumed to have an underlying linear order, which governs consecutive embeddings. For each poset we ask the well quasi-order and atomicity decidability questions: Given finitely many equivalence relations <span> <span>\\(\\rho _1,\\dots ,\\rho _k\\)</span> </span>, is the downward closed set <span> <span>\\({{\\,\\textrm{Av}\\,}}(\\rho _1,\\dots ,\\rho _k)\\)</span> </span> consisting of all equivalence relations which do not contain any of <span> <span>\\(\\rho _1,\\dots ,\\rho _k\\)</span> </span>: (a) well-quasi-ordered, meaning that it contains no infinite antichains? and (b) atomic, meaning that it is not a union of two proper downward closed subsets, or, equivalently, that it satisfies the joint embedding property?</p>","PeriodicalId":501237,"journal":{"name":"Order","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2024-02-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Order","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/s11083-024-09659-9","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

We consider the posets of equivalence relations on finite sets under the standard embedding ordering and under the consecutive embedding ordering. In the latter case, the relations are also assumed to have an underlying linear order, which governs consecutive embeddings. For each poset we ask the well quasi-order and atomicity decidability questions: Given finitely many equivalence relations \(\rho _1,\dots ,\rho _k\) , is the downward closed set \({{\,\textrm{Av}\,}}(\rho _1,\dots ,\rho _k)\) consisting of all equivalence relations which do not contain any of \(\rho _1,\dots ,\rho _k\) : (a) well-quasi-ordered, meaning that it contains no infinite antichains? and (b) atomic, meaning that it is not a union of two proper downward closed subsets, or, equivalently, that it satisfies the joint embedding property?

嵌入排序下等价关系的井式准排序可判性与原子性
摘要 我们考虑了在标准嵌入排序和连续嵌入排序下有限集上等价关系的集合。在后一种情况下,我们还假定这些关系有一个基本的线性秩,它支配着连续嵌入。对于每一个正集,我们都会提出准有序性和原子性的可解性问题:给定有限多个等价关系 \(\rho _1,\dots ,\rho _k\),向下闭集 \({{\,\textrm{Av}\,}}(\rho _1,\dots ,\rho _k)\)是否由所有不包含 \(\rho _1,\dots ,\rho _k\)的等价关系组成:(a) 准有序,即它不包含无限反链?(b) 原子性,即它不是两个适当的向下封闭子集的联合,或者,等价地,它满足联合嵌入属性?
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信