The strong selection property and ordered sets of finite length

DOI10.1007/BF01182246zbMath0542.06001OpenAlexW2017329944MaRDI QIDQ795069

Peter Nevermann, Rudolf Wille

Publication date: 1984

Published in: Algebra Universalis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01182246

zbMATH Keywords

gapupper boundsrepresentationdirect productsinvariantideallower boundsfilterorder varietyseparatorretractsstrong selection propertyirreducible ordered sets

Mathematics Subject Classification ID

Partial orders, general (06A06) Representation theory of lattices (06B15)

Related Items

Holes in ordered sets, Posets, near unanimity functions and zigzags, Monotone clones, residual smallness and congruence distributivity, \(\kappa\)-embeddings of ordered sets, Generalizations of Tarski's fixed point theorem for order varieties of complete meet semilattices, NU Polymorphisms on Reflexive Digraphs, Absolute retracts and varieties generated by chordal graphs, A fixed point theorem for commuting families of relational homomorphisms. Applications to metric spaces, ordered sets and oriented graphs, Order varieties generated by \(\vee\)-semilattices of finite width, Monotone Jónsson operations and near unanimity functions, Clones, order varieties, near unanimity functions and holes, Monotone clones and the varieties they determine

Cites Work

• Unnamed Item
• Every countable lattice is a retract of a direct product of chains
• A structure theory for ordered sets
• The smallest order variety containing all chains
• Retracts and the Fixed Point Problem for Finite Partially Ordered Sets