Every countable lattice is a retract of a direct product of chains

DOI10.1007/BF01203367zbMath0545.06005OpenAlexW2081755271MaRDI QIDQ797605

Maurice Pouzet, Ivan Rival

Publication date: 1984

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

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

zbMATH Keywords

gapsretractcountably latticeidempotent endomorphic imageselection property

Mathematics Subject Classification ID

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

Related Items (9)

Holes in ordered sets ⋮ Free poset algebras and combinatorics of cones ⋮ \(\kappa\)-embeddings of ordered sets ⋮ Descending chains and antichains of the unary, linear, and monotone subfunction relations ⋮ Order varieties generated by \(\vee\)-semilattices of finite width ⋮ Obituary: Ivan Rival ⋮ Quotients of complete ordered sets ⋮ A note on axiomatizable order varieties ⋮ The strong selection property and ordered sets of finite length

Cites Work

• A structure theory for ordered sets
• The smallest order variety containing all chains
• Unnamed Item

This page was built for publication: Every countable lattice is a retract of a direct product of chains