On pseudocomplemented and Stone ordered sets
The notions of distributive, pseudocomplemented and Stone ordered sets are generalisations of the analogous notions in lattice theory. In their definitions the lattice operations are replaced by upper and lower cones of subsets of ordered sets. If \(A\) is an ordered set and \(\text{DM}(A)\) is the Dedekind-MacNeille completion of \(A\), denote by \(G(A)\) the sublattice of \(\text{DM}(A)\) generated by \(A\). It is known, e.g., that \(A\) is distributive if and only if \(G(A)\) is distributive. In the paper under review it is shown that there is a distributive pseudocomplemented ordered set \(A\) such that \(G(A)\) is not pseudocomplemented. So a stronger notion of pseudocomplementedness is introduced, which is shown to be equivalent on \(A\) and on \(G(A)\).
- On pseudocomplemented and Stone ordered sets, addendum
- scientific article; zbMATH DE number 774077
- Boolean and distributive ordered sets: Characterization and representation by sets
- A characterization of finite Stone pseudocomplemented ordered sets
- Distributive ordered sets and relative pseudocomplements
- On pseudocomplemented and Stone ordered sets, addendum
- Boolean and distributive ordered sets: Characterization and representation by sets
- Completions of pseudo ordered sets
- Algebraic aspects of relatively pseudocomplemented posets
- A characterization of finite Stone pseudocomplemented ordered sets
- scientific article; zbMATH DE number 774077 (Why is no real title available?)
- Distributive ordered sets and relative pseudocomplements
This page was built for publication: On pseudocomplemented and Stone ordered sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5951889)
