We define the notion of meet-uniformity for closure operators on a complete lattice, which corresponds to co-additivity restricted to subsets mapped into the same element, and we study its properties. A class of closures given by principal filters and the downward closures are relevant examples of meet-uniform closures. Next, we introduce a lifting of a complete order by means of a meet-uniform closure. Our main results show that this lifting preserves the complete lattice structure, and allows the meet-uniform closure to become fully co-additive
Abstract. In this paper, a theorem on the existence of complete embedding of partially ordered monoi...
Canonical extensions of (bounded) lattices have been extensively studied, and the basic existence an...
We investigate the use of nets indexed by preorders in uniform spaces. Nine different Cauchy conditi...
In this paper, we weaken the conditions for the existence of adjoint closure operators, going beyond...
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...
In this paper we weaken the conditions for the existence of adjoint closure opera- tors, going beyon...
It is well known that closure operators on a complete lattice, ordered pointwise, give rise to a com...
summary:To every subset $A$ of a complete lattice $L$ we assign subsets $J(A)$, $M(A)$ and define jo...
AbstractIt is well known that closure operators on a complete lattice, ordered pointwise, give rise ...
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 on meet semi-lattices, and we show that it i...
Abstract. In this paper, a theorem on the existence of complete embedding of partially ordered monoi...
Canonical extensions of (bounded) lattices have been extensively studied, and the basic existence an...
We investigate the use of nets indexed by preorders in uniform spaces. Nine different Cauchy conditi...
In this paper, we weaken the conditions for the existence of adjoint closure operators, going beyond...
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...
In this paper we weaken the conditions for the existence of adjoint closure opera- tors, going beyon...
It is well known that closure operators on a complete lattice, ordered pointwise, give rise to a com...
summary:To every subset $A$ of a complete lattice $L$ we assign subsets $J(A)$, $M(A)$ and define jo...
AbstractIt is well known that closure operators on a complete lattice, ordered pointwise, give rise ...
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 on meet semi-lattices, and we show that it i...
Abstract. In this paper, a theorem on the existence of complete embedding of partially ordered monoi...
Canonical extensions of (bounded) lattices have been extensively studied, and the basic existence an...
We investigate the use of nets indexed by preorders in uniform spaces. Nine different Cauchy conditi...