General non-structure theory and constructing from linear orders

arXiv2305.02003MaRDI QIDQ6435153FDOQ6435153

Publication date: 3 May 2023

Abstract: The theme of the first two sections, is to prepare the framework of how from a ``complicated family of so called index models $I i n K_{1}$ we build many and/or complicated structures in a class $K_{2}$ . The index models are characteristically linear orders, trees with $k a p p a + 1$ levels (possibly with linear order on the set of successors of a member) and linearly ordered graphs; for this we formulate relevant complicatedness properties (called bigness). In the third section we show stronger results concerning linear orders. If for each linear order $I$ of cardinality $l a m b d a > a l e p h_{0}$ we can attach a model $M_{I} i n K_{l} a m b d a$ in which the linear order can be embedded such that for enough cuts of $I$ , their being omitted is reflected in $M_{I}$ , then there are $2^{l} a m b d a$ non-isomorphic cases. We also do the work for some applications.

Mathematics Subject Classification ID

Other combinatorial set theory (03E05) Set-theoretic model theory (03C55) Applications of set theory (03E75) Logical aspects of Boolean algebras (03G05)

This page was built for publication: General non-structure theory and constructing from linear orders

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6435153)