A partial order where all monotone maps are definable
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,≤).
A poset hierarchy
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...
A proof and an extension of a theorem of G. Birkhoff.
A Proof And An Extension Of A Theorem Of G. Birkoff
A remark on growth relation.
A remark on signed posets and signed graphs
A simple proof of Suzumura's extension theorem for finite domains with applications.
A Theorem on Directed Quasi-Ordered Sets and Some Remarks
A weakly associative generalization of the variety of representable lattice ordered groups
Absolute flatness and amalgams in pomonoids.
Algebraic and graph-theoretic properties of infinite -posets
A -labeled -poset is an (at most) countable set, labeled in the set , equipped with partial orders. The collection of all -labeled -posets is naturally equipped with binary product operations and -ary product operations. Moreover, the -ary product operations give rise to
Algebraic and graph-theoretic properties of infinite n-posets
A Σ-labeled n-poset is an (at most) countable set, labeled in the set Σ, equipped with n partial orders. The collection of all Σ-labeled n-posets is naturally equipped with n binary product operations and nω-ary product operations. Moreover, the ω-ary product operations give rise to nω-power operations. We show that those Σ-labeled n-posets that can be generated from the singletons by the binary and ω-ary product operations form the free algebra on Σ in a variety axiomatizable by an infinite collection...
All ordered sets having amenable lattice orders
An approach to covering dimensions
Using certain ideas connected with the entropy theory, several kinds of dimensions are introduced for arbitrary topological spaces. Their properties are examined, in particular, for normal spaces and quasi-discrete ones. One of the considered dimensions coincides, on these spaces, with the Čech-Lebesgue dimension and the height dimension of posets, respectively.
An embedding problem and its application in linguistics
Annihilators and ideals in distributive and modular ordered sets
Annihilators and ideals in ordered sets
Antimorphisms of partially ordered sets
Applications of the theory of partially ordered sets to cluster analysis
Äquivalenz- und Ordnungsrelationen