AbstractClosure spaces have been previously investigated by Paul Edelman and Robert Jamison as ‘convex geometries’. Consequently, a number of the results given here duplicate theirs. However, we employ a slightly different, but equivalent, defining axiom which gives a new flavor to our presentation.The major contribution is the definition of a partial order on all subsets, not just closed (or convex) subsets. It is shown that the subsets of a closure space, so ordered, form a lattice with regular, although non-modular, properties. Investigation of this lattice becomes our primary focus
In this paper we study two lattices of significant particular closure systems on a finite set, namel...
International audienceIn this paper we study two lattices of significant particular closure systems ...
In 1960, José Morgado gave a necessary and sufficient condition on a poset P in order that closure ...
For a closure space (P,f) with f(\emptyset)=\emptyset, the closures of open subsets of P, called the...
AbstractIt is well known that closure operators on a complete lattice, ordered pointwise, give rise ...
It is well known that closure operators on a complete lattice, ordered pointwise, give rise to a com...
In this paper we show that the set of closure relations on a nite poset P forms a supersolvable latt...
For a closure space (P,f) with f(\emptyset)=\emptyset, the closures of open subsets of P, called the...
For a closure space (P,f) with f(\emptyset)=\emptyset, the closures of open subsets of P, called the...
Discrete systems such as sets, monoids, groups are familiar categories. The internal strucutre of ...
Discrete systems such as sets, monoids, groups are familiar categories. The internal strucutre of ...
AbstractGeometries on finite partially ordered sets extend the concept of matroids on finite sets to...
In this paper, a theorem on the existence of complete embedding of partially ordered monoids into co...
AbstractGeometries on finite partially ordered sets extend the concept of matroids on finite sets to...
This paper is concerned with the concept of closure.\ud It is a notion which is found abundantly in ...
In this paper we study two lattices of significant particular closure systems on a finite set, namel...
International audienceIn this paper we study two lattices of significant particular closure systems ...
In 1960, José Morgado gave a necessary and sufficient condition on a poset P in order that closure ...
For a closure space (P,f) with f(\emptyset)=\emptyset, the closures of open subsets of P, called the...
AbstractIt is well known that closure operators on a complete lattice, ordered pointwise, give rise ...
It is well known that closure operators on a complete lattice, ordered pointwise, give rise to a com...
In this paper we show that the set of closure relations on a nite poset P forms a supersolvable latt...
For a closure space (P,f) with f(\emptyset)=\emptyset, the closures of open subsets of P, called the...
For a closure space (P,f) with f(\emptyset)=\emptyset, the closures of open subsets of P, called the...
Discrete systems such as sets, monoids, groups are familiar categories. The internal strucutre of ...
Discrete systems such as sets, monoids, groups are familiar categories. The internal strucutre of ...
AbstractGeometries on finite partially ordered sets extend the concept of matroids on finite sets to...
In this paper, a theorem on the existence of complete embedding of partially ordered monoids into co...
AbstractGeometries on finite partially ordered sets extend the concept of matroids on finite sets to...
This paper is concerned with the concept of closure.\ud It is a notion which is found abundantly in ...
In this paper we study two lattices of significant particular closure systems on a finite set, namel...
International audienceIn this paper we study two lattices of significant particular closure systems ...
In 1960, José Morgado gave a necessary and sufficient condition on a poset P in order that closure ...