Rigid chains admitting many embeddings
A chain is rigid if it has no non-trivial automorphism and it is superdense if it can be embedded into any of its intervals. Modifying a classical construction of Dushnik and Miller, the authors show that there is a dense subset of \(\mathbb{R}\) which is rigid and superdense. For \(\kappa\) regular and uncountable, they give a completely different construction of a rigid chain of cardinality \(\kappa\). This is done using stationary sets for coding points of a dense subset of the chain under construction. Using finite sequences of stationary sets they construct a rigid superdense chain of cardinality \(\kappa\). They show that their method can be modified to obtain a rigid superdense chain of cardinality \(\kappa\) for any uncountable \(\kappa\).
- Complementary closed relational clones are not always Krasner clones
- Concerning similarity transformations of linearly ordered sets
- scientific article; zbMATH DE number 3741468 (Why is no real title available?)
- scientific article; zbMATH DE number 3767656 (Why is no real title available?)
- scientific article; zbMATH DE number 980363 (Why is no real title available?)
- Super-Rigid Families of Strongly Blackwell Spaces
- The existence of rigid measurable spaces
- 1-transitive cyclic orderings
- The existence of rigid measurable spaces
- Generalized representation theorem and its application to the construction of fuzzy sets: existence and uniqueness
- From fuzzy sets to the decompositions of non-rigid sets
- Uniqueness results in the representation of families of sets by fuzzy sets
- scientific article; zbMATH DE number 4015659 (Why is no real title available?)
- Surjectively rigid chains
- Uncountable homogeneous structures
This page was built for publication: Rigid chains admitting many embeddings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2706570)
