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 introduce the so-called DN-algebra whose axiomatic system is a common axiomatization of directoids with an antitone involution and the so-called D-quasiring. It generalizes the concept of Newman algebras (introduced by H. Dobbertin) for a common axiomatization of Boolean algebras and Boolean rings.
Following the ideas of R. DeMarr, we establish a Galois connection between distance functions on a set and inequality relations on . Moreover, we also investigate a relationship between the functions of and .
In the context of the atomic poset, we propose several new methods of constructing the complete lattice and the algebraic lattice, and the mutual decision of relationship between atomic posets and complete lattices (algebraic lattices) is studied.
It is consistent that there is a partial order (P,≤) of size such that every monotone function f:P → P is first order definable in (P,≤).
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...