A poset hierarchy.

*(English)*Zbl 1105.03038Summary: This article extends a paper of U. Abraham and R. Bonnet [Fundam. Math. 159, 51–69 (1999; Zbl 0934.06005)] which generalised the famous Hausdorff characterisation of the class of scattered linear orders. They gave an inductively defined hierarchy that characterised the class of scattered posets which do not have infinite incomparability antichains (i.e. have the FAC). We define a larger inductive hierarchy \(^\kappa{\mathcal H}^*\) which characterises the closure of the class of all \(\kappa\)-well-founded linear orders under inversions, lexicographic sums and FAC weakenings. This includes a broader class of “scattered” posets that we call \(\kappa\)-scattered. These posets cannot embed any order such that for every two subsets of size \(<\kappa\), one being strictly less than the other, there is an element in between. If a linear order has this property and has size \(\kappa\) it is unique and called \(\mathbb{Q}(\kappa)\). Partial orders such that for every \(a<b\) the set \(\{x:a<x<b\}\) has size \(\geq\kappa\) are called weakly \(\kappa\)-dense, and posets that do not have a weakly \(\kappa\)-dense subset are called strongly \(\kappa\)-scattered. We prove that \(^\kappa{\mathcal H}^*\) includes all strongly \(\kappa\)-scattered FAC posets and is included in the class of all FAC \(\kappa\)-scattered posets. For \(\kappa=\aleph_0\) the notions of scattered and strongly scattered coincide and our hierarchy is exactly \(\text{aug}({\mathcal H})\) from the Abraham-Bonnet theorem.

##### MSC:

03E04 | Ordered sets and their cofinalities; pcf theory |

06A05 | Total orders |

06A06 | Partial orders, general |

##### Keywords:

well-founded linear orders; scattered posets; inductive hierarchy; weakly \(\kappa\)-dense; strongly \(\kappa\)-scattered; FAC posets
PDF
BibTeX
XML
Cite

\textit{M. Džamonja} and \textit{K. Thompson}, Cent. Eur. J. Math. 4, No. 2, 225--241 (2006; Zbl 1105.03038)

Full Text:
DOI

##### References:

[1] | U. Abraham and R. Bonnet: “Hausdorff’s Theorem for Posets That Satisfy the Finite Antichain Property”, Fundamenta Mathematica, Vol. 159(1), (1999), pp. 51-69. · Zbl 0934.06005 |

[2] | F. Hausdorff: “Grundzüge einer Theorie der geordneten Mengenlehre” (in German), Mathematische Annalen, Vol. 65, (1908), pp. 435-505. http://dx.doi.org/10.1007/BF01451165 · JFM 39.0099.01 |

[3] | R. Bonnet and M. Pouzet: “Linear Extensions of Ordered Sets”, In: Ordered Sets, D. Reidel Publishing Company, 1982, pp. 125-170. · Zbl 0499.06002 |

[4] | R. Bonnet and M. Pouzet: “Extension et stratification d’ensembles dispersés” (in French), C.R.A.S., Paris, Série A, Vol. 168, (1969), pp. 1512-1515. · Zbl 0188.04203 |

[5] | S. Shelah: Nonstructure Theory, to appear. |

[6] | S. Shelah: Classification Theory, Revised ed., Studies in Logic and Foundations of Mathematics, Vol. 92, North-Holland, 1990. · Zbl 0713.03013 |

[7] | G. Asser, J. Flachsmeyer and W. Rinow: Theory of Sets and Topology; In honour of Felix Hausdorff, Deutscher Verlag der Wissenschaften, 1972. · Zbl 0256.00006 |

[8] | H.J. Kiesler and C.C. Chang: Model Theory, 3rd ed., Studies in Logic and Foundations of Mathematics, Vol. 73, Elsevier Science B.V., 1990. |

[9] | R. Fraïssé: Theory of Relations, Revised ed., Studies in Logic and Foundations of Mathematics, Vol. 145, Elsevier Science, B.V., 2000. |

[10] | J. Rosenstein: Linear Orderings, Pure and Applied Mathematics, Academic Press, 1982. |

[11] | E. Mendelson: “On a class of universal ordered sets”, Proc. Amer. Math. Soc., Vol. 9, (1958), pp. 712-713. http://dx.doi.org/10.2307/2033073 · Zbl 0087.27001 |

[12] | M. Kojman and S. Shelah: “Non-existence of Universal Orders in Many Cardinals”, J. Symbolic Logic, Vol. 57(3), (1992), pp. 875-891. · Zbl 0790.03036 |

This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.