We characterize totally ordered sets within the class of all ordered sets containing at least four-element chains. We use a simple relationship between their isotone transformations and the so called 1-endomorphism which is introduced in the paper. Later we describe 1-, 2-, 3-, 4-homomorphisms of ordered sets in the language of super strong mappings.
We construct a totally ordered set Γ of positive infinite germs (i.e. germs of positive real-valued functions that tend to +∞), with order type being the lexicographic product ℵ1 × ℤ2. We show that Γ admits order preserving automorphisms of pairwise distinct growth rates.
All ordinal numbers with the following property are found: there exists a loop such that its subloops form a chain of ordinal type .
This article extends a paper of Abraham and Bonnet 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 κℌ* which characterises the closure of the class of all κ-well-founded linear orders under inversions, lexicographic sums and FAC weakenings. This...