summary:We extend the notion of a relatively pseudocomplemented meet-semilattice to arbitrary posets. We show some properties of the binary operation of relative pseudocomplementation and provide some corresponding characterizations. We show that relatively pseudocomplemented posets satisfying a certain simple identity in two variables are join-semilattices. Finally, we show that every relatively pseudocomplemented poset is distributive and that the converse holds for posets satisfying the ascending chain condition and one more natural condition. Suitable examples are provided
We define the notion of weak relative pseudo-complement on meet semi-lattices, and we show that it i...
We define the notion of weak relative pseudo-complement on meet semi-lattices, and we show that it i...
summary:The concept of a relatively pseudocomplemented directoid was introduced recently by the firs...
summary:We extend the notion of a relatively pseudocomplemented meet-semilattice to arbitrary posets...
summary:We extend the notion of a relatively pseudocomplemented meet-semilattice to arbitrary posets...
Some recent results provide sufficient conditions for complete lattices of closure operators on comp...
AbstractSome recent results provide sufficient conditions for complete lattices of closure operators...
Some recent results provide sufficient conditions for complete lattices of closure operators on comp...
Some recent results provide sufficient conditions for complete lattices of closure operators on comp...
summary:We show that every pseudocomplemented poset can be equivalently expressed as a certain algeb...
summary:We show that every pseudocomplemented poset can be equivalently expressed as a certain algeb...
summary:We show that every pseudocomplemented poset can be equivalently expressed as a certain algeb...
This paper provides new results on pseudotrees. First, it is shown that pseudotrees are precisely th...
We define the notion of weak relative pseudo-complement on meet semi-lattices, and we show that it i...
AbstractSome recent results provide sufficient conditions for complete lattices of closure operators...
We define the notion of weak relative pseudo-complement on meet semi-lattices, and we show that it i...
We define the notion of weak relative pseudo-complement on meet semi-lattices, and we show that it i...
summary:The concept of a relatively pseudocomplemented directoid was introduced recently by the firs...
summary:We extend the notion of a relatively pseudocomplemented meet-semilattice to arbitrary posets...
summary:We extend the notion of a relatively pseudocomplemented meet-semilattice to arbitrary posets...
Some recent results provide sufficient conditions for complete lattices of closure operators on comp...
AbstractSome recent results provide sufficient conditions for complete lattices of closure operators...
Some recent results provide sufficient conditions for complete lattices of closure operators on comp...
Some recent results provide sufficient conditions for complete lattices of closure operators on comp...
summary:We show that every pseudocomplemented poset can be equivalently expressed as a certain algeb...
summary:We show that every pseudocomplemented poset can be equivalently expressed as a certain algeb...
summary:We show that every pseudocomplemented poset can be equivalently expressed as a certain algeb...
This paper provides new results on pseudotrees. First, it is shown that pseudotrees are precisely th...
We define the notion of weak relative pseudo-complement on meet semi-lattices, and we show that it i...
AbstractSome recent results provide sufficient conditions for complete lattices of closure operators...
We define the notion of weak relative pseudo-complement on meet semi-lattices, and we show that it i...
We define the notion of weak relative pseudo-complement on meet semi-lattices, and we show that it i...
summary:The concept of a relatively pseudocomplemented directoid was introduced recently by the firs...