<?xml version="1.0" encoding="UTF-8"?>
<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
  <responseDate>2026-07-22T19:10:17Z</responseDate>
  <request identifier="125" metadataPrefix="oai_dc" verb="GetRecord">https://drops.dagstuhl.de/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:drops-oai.dagstuhl.de:125</identifier>
        <datestamp>2024-03-06T11:05:50Z</datestamp>
        <setSpec>ddc:004</setSpec>
        <setSpec>open_access</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
          <dc:title>A Category of Discrete Closure Spaces</dc:title>
          <dc:creator>Pfaltz, John L.</dc:creator>
          <dc:subject>Category</dc:subject>
          <dc:subject>closure</dc:subject>
          <dc:subject>antimatroid</dc:subject>
          <dc:subject>function</dc:subject>
          <dc:description>Discrete systems such as sets, monoids, groups are familiar categories.  &#13;
The internal strucutre of the latter two is defined by an algebraic operator.  &#13;
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.&#13;
Next we develop the ideas of closed and complete functions over closure spaces.  These can be used to establish criteria for asserting &#13;
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.</dc:description>
          <dc:publisher>Schloss Dagstuhl – Leibniz-Zentrum für Informatik</dc:publisher>
          <dc:contributor>John L. Pfaltz</dc:contributor>
          <dc:date>2005</dc:date>
          <dc:relation>Is Part Of Dagstuhl Seminar Proceedings, Volume 4351, Spatial Representation: Discrete vs. Continuous Computational Models (2005)</dc:relation>
          <dc:type>InProceedings</dc:type>
          <dc:type>Text</dc:type>
          <dc:type>doc-type:ResearchArticle</dc:type>
          <dc:type>publishedVersion</dc:type>
          <dc:format>application/pdf</dc:format>
          <dc:identifier>doi:10.4230/DagSemProc.04351.4</dc:identifier>
          <dc:identifier>urn:nbn:de:0030-drops-1253</dc:identifier>
          <dc:identifier>https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.04351.4</dc:identifier>
          <dc:language>eng</dc:language>
          <dc:rights>https://creativecommons.org/licenses/by/4.0/legalcode</dc:rights>
        </oai_dc:dc>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
