2000 character limit reached
Combinatorial background for non-structure
Published 15 Dec 2015 in math.LO | (1512.04767v1)
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].
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.