• Corpus ID: 237365107

Partition theorems for expanded trees

  title={Partition theorems for expanded trees},
  author={Saharon Shelah},
. We look for partition theorems for large subtrees for suitable un- countable trees and colourings. We concentrate on sub-trees of κ ≥ 2 expanded by a well ordering of each level. Unlike earlier works, we do not ask the embedding to preserve the height of the tree I but the embedding does not. We get consistency results without large cardinals. The intention is to apply it to model theoretic problems. 


A Ramsey Theorem for Trees
A partition theorem for the infinite subtrees of a tree
We prove a generalization for infinite trees of Silver's partition theorem. This theorem implies a version for trees of the Nash-Williams partition theorem.
Combinatorial Set Theory: Partition Relations for Cardinals
Fundamentals about Partition Relations. Trees and Positive Ordinary Partition Relations. Negative Ordinary Partition Relations and the Discussion of the Finite Case. The Canonization Lemmas. Large
Two cardinal compactness
It is proved that ifλ≧μℵo=μ≧|T | and if every finite subtheory ofT has a (λ, μ)-model thenT has such a model, then there are generalizations forμ-like models.
For any finite d ≥ 2, it is proved that the consistency of the Halpern–Läuchli Theorem on d many normal κ-trees at a measurable cardinal κ is given, givenThe consistency of a κ + d-strong cardinal.
Norms on Possibilities I: Forcing With Trees and Creatures
We present a systematic study of the method of "norms on possibilities" of building forcing notions with keeping their properties under full control. This technique allows us to answer several open
On Fraisse's order type conjecture
ing from the embeddability relation between order types, define a quasi-order to be a reflexive, transitive relation. Throughout this paper, the letters Q and R will range over quasi-ordered sets and
Ramsey theorems for product of finite sets with submeasures
We prove parametrized partition theorem on products of finite sets equipped with submeasures, improving the results of Di Prisco, Llopis, and Todorcevic.
A partition theorem
We prove a partition theorem (in the sense of the theorems of Ramsey [3], Erdos-Rado [1], and Rado [2]) which together with a forthcoming paper by Halpern and A. Levy will constitute a proof of the