Abstract
Boolean ordered sets generalize Boolean lattices, and distributive ordered sets generalize distributive lattices. Ideals, prime ideals, and maximal ideals in ordered sets are defined, and some well-known theorems on Boolean lattices, such as the Glivenko-Stone theorem and the Stone representation theorem, are generalized to Boolean ordered sets. A prime ideal theorem for distributive ordered sets is formulated, and the Birkhoff representation theorem is generalized to distributive ordered sets. Fundamental are the embedding theorems for Boolean ordered sets and for distributive ordered sets.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Chajda, Ivan (1992) Complemented ordered sets,Archivum Math. (Brno)28, 25–34.
Chajda, Ivan and Rachůnek, Jiří (1989) Forbidden configurations for distributive and modular ordered sets,Order 5, 407–423.
Frink, Orrin (1954) Ideals in partially ordered sets,Amer. Math. Monthly 61, 223–234.
Halaš, Radomír (1993) Pseudocomplemented ordered sets,Archivum Math. (Brno)29, 153–160.
Larmerová, Jana and Rachůnek, Jiří (1988) Translations of distributive and modular ordered sets,Acta Univ. Palack. Olom., Math. 27, 13–23.
Niederle, Josef (1991) Natural generalization of some lattice theory concepts to partially ordered sets,Czechoslovak Math. J. 41, 297–299.
Paseka, Jan (in preparation) Note on distributive posets.
Author information
Authors and Affiliations
Additional information
Communicated by G. Grätzer
Financial support of the Grant Agency of the Czech Republic under the grant No. 201/93/0950 is gratefully acknowledged.
Rights and permissions
About this article
Cite this article
Niederle, J. Boolean and distributive ordered sets: Characterization and representation by sets. Order 12, 189–210 (1995). https://doi.org/10.1007/BF01108627
Received:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/BF01108627