<?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-23T13:08:52Z</responseDate>
  <request identifier="119" metadataPrefix="oai_dc" verb="GetRecord">https://drops.dagstuhl.de/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:drops-oai.dagstuhl.de:119</identifier>
        <datestamp>2024-03-06T11:05:52Z</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>The Hofmann-Mislove Theorem for general posets</dc:title>
          <dc:creator>Kovar, Martin</dc:creator>
          <dc:subject>Posets</dc:subject>
          <dc:subject>generalized Scott topology</dc:subject>
          <dc:subject>Scott open filters</dc:subject>
          <dc:subject>(filtered) compactness</dc:subject>
          <dc:subject>saturated</dc:subject>
          <dc:description>In this paper we attempt to find and investigate the most general class of posets which satisfy a properly generalized version of the Hofmann-Mislove theorem. For that purpose, we generalize and study some notions (like compactness, the Scott topology, Scott open filters, prime elements, the spectrum etc.), and adjust them for use in general posets. Then we characterize the posets satisfying the Hofmann-Mislove theorem by the relationship between the generalized Scott closed prime subsets and the generalized prime elements of the poset. The theory become classic for distributive lattices. Remark that the topologies induced on the generalized spectra in general need not be&#13;
sober.</dc:description>
          <dc:publisher>Schloss Dagstuhl – Leibniz-Zentrum für Informatik</dc:publisher>
          <dc:contributor>Martin Kovar</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.20</dc:identifier>
          <dc:identifier>urn:nbn:de:0030-drops-1199</dc:identifier>
          <dc:identifier>https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.04351.20</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>
