Combinatorial background for non-structure

Abstract

This was supposed to be an appendix to the book "Non-structure", and probably will be if it materializes. It presents relevant material, sometimes new, which was used in works which were supposed to be part of that book. In section 1 we deal with partition theorems on trees with omega levels; it is self contained. In section 2 we deal with linear orders which are countable union of scattered ones with unary predicated, it is self contained. In section 3 we deal mainly with pcf theory but just quote. In section 4, on normal ideals, we repeat [Sh:247]. This is used in [Sh:331].

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…