Identities in ordered sets

DOI10.1023/A:1006214005914MaRDI QIDQ1304914zbMATH OpenOpenAlexFDO

Authors Josef Niederle

Publication date 24 July 2000

Published in Order (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1006214005914

zbMATH Keywords

characteristic latticeDedekind-MacNeille completiondistributive identityidentity in ordered setslattice identitylower boundmodular identitytermupper bound

Mathematics Subject Classification ID

Partial orders, general (06A06)

Review text

The paper deals with lattice-like features of ordered sets. The author introduces the notions of term and identity for ordered sets in the language using, besides the lattice operations, also the symbols \(L\) and \(U\) which are interpreted as the sets of all lower and upper bounds, respectively, of the unions of arguments. It is shown that the identities of ordered sets are in a one-one correspondence with the lattice identities. In connection with this result a question arises: which lattice identities are inherited from any ordered set to its characteristic lattice (i.e., to the lattice generated by an ordered set in its Dedekind-MacNeille completion). The author shows that this is valid for the distributive identity but it fails in the case of the modular identity.

Recommendations

• Forbidden configurations for distributive and modular ordered sets
• scientific article; zbMATH DE number 219489
• scientific article; zbMATH DE number 431367
• scientific article; zbMATH DE number 63715
• The order of principal congruences of a bounded lattice

Cited in

(3)

• A syntactic approach to the MacNeille completion of ^, the free monoid over an ordered alphabet
• Strict identity with no overlap
• Proof theory for lattice-ordered groups

This page was built for publication: Identities in ordered sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1304914)