We define the notion of weak relative pseudo-complement on meet semi-lattices, and we show that it is strictly weaker than relative pseudo-complementation, but stronger than pseudo-complementation. Our main result is that if a complete lattice L is meet-continuous, then every closure operator on L admits weak relative pseudo-complements with respect to continuous closure operators on L
The notion of semi-prime (resp., meet) weak closure operation is introduced and related properties a...
We define the notion of meet-uniformity for closure operators on a complete lattice, which correspo...
summary:The notion of an Almost Distributive Lattice (abbreviated as ADL) was introduced by U. M. Sw...
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...
We define the notion of weak relative pseudo-complement, and we show that, for an arbitrary lattice,...
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...
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...
AbstractSome recent results provide sufficient conditions for complete lattices of closure operators...
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...
summary:We extend the notion of a relatively pseudocomplemented meet-semilattice to arbitrary posets...
In this paper, the concept of relative complementation in almost distributive lattice is generalized...
The notion of semi-prime (resp., meet) weak closure operation is introduced and related properties a...
We define the notion of meet-uniformity for closure operators on a complete lattice, which correspo...
summary:The notion of an Almost Distributive Lattice (abbreviated as ADL) was introduced by U. M. Sw...
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...
We define the notion of weak relative pseudo-complement, and we show that, for an arbitrary lattice,...
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...
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...
AbstractSome recent results provide sufficient conditions for complete lattices of closure operators...
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...
summary:We extend the notion of a relatively pseudocomplemented meet-semilattice to arbitrary posets...
In this paper, the concept of relative complementation in almost distributive lattice is generalized...
The notion of semi-prime (resp., meet) weak closure operation is introduced and related properties a...
We define the notion of meet-uniformity for closure operators on a complete lattice, which correspo...
summary:The notion of an Almost Distributive Lattice (abbreviated as ADL) was introduced by U. M. Sw...