A partition theorem for scattered order types
英文摘要：
If phi is a scattered order type, mu a cardinal, then there exists a scattered order type psi such that psi->[phi]^1_{mu,aleph_0} holds.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
相关论文
Partitioning subsets of generalised scattered orders
In 1956, 48 years after Hausdorff provided a comprehensive account on ordered sets and defined the notion of a scattered order, Erdős and Rado founded the partition calculus in a seminal paper. The present paper gives an account of investigations into generalisations of scattered linear orders and their partition relations for both singletons and pairs. It provides analogues of the Milner-Rado paradox for these orders instead of ordinals. For infinite, regular $κ$, we investigate the extent to which the classes of $κ$-scattered, weakly $κ$-scattered, and $κ$-saturated linear orders of size $κ$…
math.LO
A partition theorem for pairs of finite sets
Every partition of [[omega_1]^{< omega}]^2 into finitely many pieces has a cofinal homogeneous set. Furthermore, it is consistent that every directed partially ordered set satisfies the partition property if and only if it has finite character.
math.LO
A proof of Shelah's recent partition theorem
Shelah's own proof to his recent polarized partition theorem involving a singular strong limit that violates the GCH is presented. The proof is slightly re-arranges so that no use of the ideal I[λ] is made. The proof should be readabel to any student with knowledge of set theory.
math.LO
Laver分划定理的可计算方面
Computable aspects of the Laver partition theorem
Università di Udine（乌迪内大学）
该文研究Laver分划定理的反数学与Weihrauch度，明确其证明论强度上下界及相关问题的算术Weihrauch度，为其可计算方面提供精确刻画。
math.LO
A Formalised Theorem in the Partition Calculus
A paper on ordinal partitions by Erdős and Milner (1972) has been formalised using the proof assistant Isabelle/HOL, augmented with a library for Zermelo-Fraenkel set theory. The work is part of a project on formalising the partition calculus. The chosen material is particularly appropriate in view of the substantial corrections later published by its authors, illustrating the potential value of formal verification.
math.LO
交叉约束基定理与划分的乘积
Cross-constraint basis theorems and products of partitions
本文综述并扩展了陆刘的技术，证明了n元组三色Ramsey定理不能可计算归约到n元组两色Ramsey定理的有限乘积。
math.LO
更多相关论文收起更多论文
There may be no minimal non $σ$-scattered linear orders
In this paper we demonstrate that it is consistent, relative to the existence of a supercompact cardinal, that there is no linear order which is minimal with respect to being non $σ$-scattered. This shows that a theorem of Laver, which asserts that the class of $σ$-scattered linear orders is well quasi-ordered, is sharp. We also prove that PFA${}^+$ implies that every non $σ$-scattered linear order either contains a real type, an Aronszajn type, or a ladder system indexed by a stationary subset of $ω_1$, equipped with either the lexicographic or reverse lexicographic order. Our work immediatel…
math.LO
分区通用性与鸽巢基定理
Partition genericity and pigeonhole basis theorems
本文提出分区通用性概念，证明余超免疫集与 Kurtz 随机集均具有该性质，并由此回答 Kjos-Hanssen 和 Liu 的问题，统一推出多个鸽巢基定理。
math.LO
Ramsey theory over partitions II: Negative Ramsey relations and pump-up theorems
In this series of papers we advance Ramsey theory of colorings over partitions. In this part, we concentrate on anti-Ramsey relations, or, as they are better known, strong colorings, and in particular solve two problems from [CKS21]. It is shown that for every infinite cardinal $λ$, a strong coloring on $λ^+$ by $λ$ colors over a partition can be stretched to one with $λ^{+}$ colors over the same partition. Also, a sufficient condition is given for when a strong coloring witnessing $Pr_1(\ldots)$ over a partition may be improved to witness $Pr_0(\ldots)$. Since the classical theory corresponds…
math.LO
扩展树的划分定理
Partition theorems for expanded trees
本文研究扩展树的大子树划分定理，通过保持层次相等性而非高度保持，得到不依赖大基数的一致性结果，并应用于模型论问题。
math.LO
A canonical partition theorem for uniform families of finite strong subtrees
Extending a result of K. Milliken \cite{Mi2}, in this paper we prove a Ramsey classification result for equivalence relations defined on uniform families of finite strong subtrees of a finite sequence $(U_i)_{i\in d}$ of fixed trees $U_i$, $i\in d$, that have a finite uniform branching but are of infinite length.
math.LO
Partition theorems from creatures and idempotent ultrafilters
We show a general scheme of Ramsey-type results for partitions of countable sets of finite functions, where "one piece is big" is interpreted in the language originating in creature forcing. The heart of our proofs follows Glazer's proof of the Hindman Theorem, so we prove the existence of idempotent ultrafilters with respect to suitable operation. Then we deduce partition theorems related to creature forcings.
math.COmath.LO
Constructions of Lindelöf scattered P-spaces
We construct locally Lindelöf scattered P-spaces (LLSP spaces, in short) with prescribed widths and heights under different set-theoretic assumptions. We prove that there is an LLSP space of width $ω_1$ and height $ω_2$ and that it is relatively consistent with ZFC that there is an LLSP space of width $ω_1$ and height $ω_3$. Also, we prove a stepping up theorem that, for every cardinal $λ\geq ω_2$, permits us to construct from an LLSP space of width $ω_1$ and height $λ$ satisfying certain additional properties an LLSP space of width $ω_1$ and height $α$ for every ordinal $α< λ^+$. Then, we obt…
math.GNmath.LO
Partition properties of the dense local order and a colored version of Milliken's theorem
We study the finite dimensional partition properties of the countable homogeneous dense local order. Some of our results use ideas borrowed from the partition calculus of the rationals and are obtained thanks to a strengthening of Milliken's theorem on trees.
math.COmath.LO
Polish space partition principles and the Halpern-Läuchli theorem
The Halpern-Läuchli theorem, a combinatorial result about trees, admits an elegant proof due to Harrington using ideas from forcing. In an attempt to distill the combinatorial essence of this proof, we isolate various partition principles about products of perfect Polish spaces. These principles yield straightforward proofs of the Halpern-Läuchli theorem, and the same forcing from Harrington's proof can force their consistency. We also show that these principles are not ZFC theorems by showing that they put lower bounds on the size of the continuum.
math.COmath.LO
Ketonen-Solovay 大小的划分定理
Partition theorems for Ketonen-Solovay largeness: Hardy-like version
本文提出了一种关于Ketonen-Solovay大小集合的划分定理，证明了在特定条件下颜色函数存在大同质子集，并给出了该界限的紧性证明。
math.COmath.LO
