Symmetrization of Closure Operators and Visibility

For an arbitrary set E and a given closure operator , we want to construct a symmetric closure operator via some – possibly infinite – iteration process. If E is finite, the corresponding symmetric closure operator . defines a matroid. If and is the convex closure operator, turns out to be the affine closure operator. Moreover, we apply the symmetrization process to closure operators induced by visibility. Received March 9, 2005