2005
DOI: 10.1007/s11083-005-9002-0
|View full text |Cite
|
Sign up to set email alerts
|

On Uniquely Complemented Posets

Abstract: In this paper, some classical results of uniquely complemented lattices are extended to uniquely complemented posets (with 0 and 1) like Peirce's Theorem, the BirkhoffYvon Neumann Theorem, the BirkhoffYWard Theorem. Further, it is shown that a section semi-complemented pseudocomplemented poset is a Boolean poset. (2001): 06A06, 06A11, 06C15, 06C20, 06D15. Mathematics Subject Classification

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
16
0

Year Published

2013
2013
2017
2017

Publication Types

Select...
8

Relationship

1
7

Authors

Journals

citations
Cited by 12 publications
(16 citation statements)
references
References 14 publications
0
16
0
Order By: Relevance
“…A detailed study of Boolean posets can be found also in Niederle [26] and Waphare and Joshi [37]. Further, it can be easily verified that a Boolean poset is pseudocomplemented and complemented.…”
Section: Poset Of Prime Idealsmentioning
confidence: 91%
“…A detailed study of Boolean posets can be found also in Niederle [26] and Waphare and Joshi [37]. Further, it can be easily verified that a Boolean poset is pseudocomplemented and complemented.…”
Section: Poset Of Prime Idealsmentioning
confidence: 91%
“…Uniquely complemented posets were treated by B. N. Waphare and V. V. Joshi ( [15]). We will use different tools and methods and state other conditions formulated in a different language.…”
Section: Proposition 24 ([11]) Every Uniquely Complemented Pseudocommentioning
confidence: 99%
“…An important progress in this direction was already obtained by B. N. Waphare and V. V. Joshi in [15]. They formulated such conditions by means of pseudocomplements and so-called regular elements.…”
Section: Introductionmentioning
confidence: 99%
“…Denote A = {a : a ∈ A}. We say that P satisfies the De Morgan laws if {{x, y} u } = {x , y } and {{x, y} } = {x , y } u for all x, y ∈ P ; see [3,23].…”
Section: Zero Divisor Graphs Of Boolean Posetsmentioning
confidence: 99%