Boolean and distributive ordered sets: Characterization and representation by sets (Q1904396): Difference between revisions
From MaRDI portal
Removed claims |
ReferenceBot (talk | contribs) Changed an Item |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / author | |||
Property / author: Josef Niederle / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: V. N. Salij / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3138111 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Forbidden configurations for distributive and modular ordered sets / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Ideals in Partially Ordered Sets / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4298406 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3035342 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3982193 / rank | |||
Normal rank |
Latest revision as of 07:57, 24 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Boolean and distributive ordered sets: Characterization and representation by sets |
scientific article |
Statements
Boolean and distributive ordered sets: Characterization and representation by sets (English)
0 references
6 June 1996
0 references
Let \((A,\leq)\) be an ordered set and \(X\subseteq A\). Denote by \(L(X)\) the lower cone of \(X\) in \(A\) and by \(U(X)\) the upper cone of \(X\). An ordered set \((A, \leq)\) is said to be distributive if \(L(x, U(y,z))= L(U(L (x,y),L(x,z)))\) for all \(x,y,z\in A\). An element \(y\in A\) is called a complement of \(x\) in \((A,\leq)\) if \(L(x,y)= L(A)\) and \(U(x,y)= U(A)\). A Boolean ordered set is defined as a distributive ordered set of which each element has a complement in \(A\). Some well-known theorems such as the Glivenko-Stone theorem and the Stone representation theorem on Boolean algebras and the Birkhoff representation theorem for distributive lattices are generalized to Boolean ordered sets and to distributive ordered sets, respectively.
0 references
prime ideal
0 references
maximal ideal
0 references
Boolean ordered set
0 references
distributive ordered set
0 references