License
When quoting this document, please refer to the following
URN: urn:nbn:de:0030-drops-1253
URL: http://drops.dagstuhl.de/opus/volltexte/2005/125/
Go to the corresponding Portal


Pfaltz, John L.

A Category of Discrete Closure Spaces

pdf-format:
Document 1.pdf (227 KB)


Abstract

Discrete systems such as sets, monoids, groups are familiar categories. The internal strucutre of the latter two is defined by an algebraic operator. In this paper we describe the internal structure of the base set by a closure operator. We illustrate the role of such closure in convex geometries and partially ordered sets and thus suggestthe wide applicability of closure systems. Next we develop the ideas of closed and complete functions over closure spaces. These can be used to establish criteria for asserting that "the closure of a functional image under $f$ is equal to the functional image of the closure". Functions with these properties can be treated as categorical morphisms. Finally, the category "CSystem" of closure systems is shown to be cartesian closed.

BibTeX - Entry

@InProceedings{pfaltz:DSP:2005:125,
  author =	{John L. Pfaltz},
  title =	{A Category of Discrete Closure Spaces},
  booktitle =	{Spatial Representation: Discrete vs. Continuous Computational Models},
  year =	{2005},
  editor =	{Ralph Kopperman and Michael B. Smyth and Dieter Spreen and Julian Webster},
  number =	{04351},
  series =	{Dagstuhl Seminar Proceedings},
  ISSN =	{1862-4405},
  publisher =	{Internationales Begegnungs- und Forschungszentrum f{\"u}r Informatik (IBFI), Schloss Dagstuhl, Germany},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2005/125},
  annote =	{Keywords: Category , closure , antimatroid , function}
}

Keywords: Category , closure , antimatroid , function
Seminar: 04351 - Spatial Representation: Discrete vs. Continuous Computational Models
Issue Date: 2005
Date of publication: 22.04.2005


DROPS-Home | Fulltext Search | Imprint Published by LZI