关于偏序的优拟序类
On better-quasi-ordering classes of partial orders
摘要:
我们提供了一种方法来构建更好的准订单的推广技术,用于构建算子代数,是由Pouzet开发的。然后,我们推广的概念$σ$ -分散的偏序,并使用我们的方法来证明类的$σ$ -分散的偏序是更好的准有序下嵌入。这推广了Laver,Corominas和Massé关于$σ$ -离散线性序和树,可数森林和N-自由偏序的定理.特别地,一类可数偏序是好拟序的,只要其成员的不可分解子集类满足好拟序的自然加强。
英文摘要:
We provide a method of constructing better-quasi-orders by generalising a technique for constructing operator algebras that was developed by Pouzet. We then generalise the notion of $σ$-scattered to partial orders, and use our method to prove that the class of $σ$-scattered partial orders is better-quasi-ordered under embeddability. This generalises theorems of Laver, Corominas and Thomassé regarding $σ$-scattered linear orders and trees, countable forests and N-free partial orders respectively. In particular, a class of countable partial orders is better-quasi-ordered whenever the class of indecomposable subsets of its members satisfies a natural strengthening of better-quasi-order.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。