A note on uniserial loops
All ordinal numbers with the following property are found: there exists a loop such that its subloops form a chain of ordinal type .
A partial order in the knot table.
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 polynomial characterization of nondistributive modular lattices
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 precedence theorem for semigroups.
A proof and an extension of a theorem of G. Birkhoff.
A Proof And An Extension Of A Theorem Of G. Birkoff
A property of the lattice of subsemilattices
A propos des quasi-ordres - Note
A relative Laplacian spectral recursion.
A remark on growth relation.
A remark on semigroups that are semilattices of right groups
A remark on signed posets and signed graphs
A remark on the extension of the concept of incidence algebras to nonlocally finite partially ordered sets.
A remark to the paper of M. Froda-Schechter: Préordres et équivalences dans l'ensemble des familles d'un ensemble
A selection theorem for Boolean correspondences.
A sharp bound for the reconstruction of partitions.
A simple basis of ideal terms of Brouwerian semilattices
A simple proof of Suzumura's extension theorem for finite domains with applications.