No abstract

In the first section of this paper, we prove an analogue of Stone's Theorem for posets satisfying DCC by using semiprime ideals. We also prove the existence of prime ideals in atomic posets in which atoms are dually distributive. Further, it is proved that every maximal non-dense (non-principal) ideal of a 0-distributive poset (meet-semilattice) is prime. The second section focuses on the characterizations of (minimal) prime ideals in pseudocomplemented posets. The third section deals with the generalization of the classical theorem of Nachbin. In fact, we prove that a dually atomic pseudocomplemented, 1-distributive poset is complemented if and only if the poset of prime ideals is unordered. In the last section, we have characterized 0-distributive posets by means of prime ideals and minimal prime ideals. MSC:06B10, 06A12

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

In this paper, it is proved that the complement of the zero-divisor graph of a partially ordered set is weakly perfect if it has finite clique number, completely answering the question raised by Joshi and Khiste [‘Complement of the zero divisor graph of a lattice’, Bull. Aust. Math. Soc. 89 (2014), 177–190]. As a consequence, the intersection graph of an intersection-closed family of nonempty subsets of a set is weakly perfect if it has finite clique number. These results are applied to annihilating-ideal graphs and intersection graphs of submodules.

No abstract