<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//TaxonX//DTD Taxonomic Treatment Publishing DTD v0 20100105//EN" "../../nlm/tax-treatment-NS0.dtd">
<article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:tp="http://www.plazi.org/taxpub" article-type="research-article" dtd-version="3.0" xml:lang="en">
  <front>
    <journal-meta>
      <journal-id journal-id-type="publisher-id">109</journal-id>
      <journal-id journal-id-type="index">urn:lsid:arphahub.com:pub:3dc5f44e-8666-58db-bc76-a455210e8891</journal-id>
      <journal-title-group>
        <journal-title xml:lang="en">JUCS - Journal of Universal Computer Science</journal-title>
        <abbrev-journal-title xml:lang="en">jucs</abbrev-journal-title>
      </journal-title-group>
      <issn pub-type="ppub">0948-695X</issn>
      <issn pub-type="epub">0948-6968</issn>
      <publisher>
        <publisher-name>Journal of Universal Computer Science</publisher-name>
      </publisher>
    </journal-meta>
    <article-meta>
      <article-id pub-id-type="doi">10.3217/jucs-014-06-0996</article-id>
      <article-id pub-id-type="publisher-id">29018</article-id>
      <article-categories>
        <subj-group subj-group-type="heading">
          <subject>Research Article</subject>
        </subj-group>
        <subj-group subj-group-type="scientific_subject">
          <subject>F.2 - ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY</subject>
          <subject>F.4.1 - Mathematical Logic</subject>
          <subject>G.1.4 - Quadrature and Numerical Differentiation</subject>
        </subj-group>
      </article-categories>
      <title-group>
        <article-title>On the Relationship between Filter Spaces and Weak Limit Spaces</article-title>
      </title-group>
      <contrib-group content-type="authors">
        <contrib contrib-type="author" corresp="yes">
          <name name-style="western">
            <surname>Schröder</surname>
            <given-names>Matthias</given-names>
          </name>
          <email xlink:type="simple">matthias.schroeder@unibw.de</email>
          <xref ref-type="aff" rid="A1">1</xref>
        </contrib>
      </contrib-group>
      <aff id="A1">
        <label>1</label>
        <addr-line content-type="verbatim">Universität der Bundeswehr, München, Germany</addr-line>
        <institution>Universität der Bundeswehr</institution>
        <addr-line content-type="city">München</addr-line>
        <country>Germany</country>
      </aff>
      <author-notes>
        <fn fn-type="corresp">
          <p>Corresponding author: Matthias Schröder (<email xlink:type="simple">matthias.schroeder@unibw.de</email>).</p>
        </fn>
        <fn fn-type="edited-by">
          <p>Academic editor: </p>
        </fn>
      </author-notes>
      <pub-date pub-type="collection">
        <year>2008</year>
      </pub-date>
      <pub-date pub-type="epub">
        <day>28</day>
        <month>03</month>
        <year>2008</year>
      </pub-date>
      <volume>14</volume>
      <issue>6</issue>
      <fpage>996</fpage>
      <lpage>1015</lpage>
      <uri content-type="arpha" xlink:href="http://openbiodiv.net/AC9D34B0-2A48-5987-A06D-D195F90DFD00">AC9D34B0-2A48-5987-A06D-D195F90DFD00</uri>
      <uri content-type="zenodo_dep_id" xlink:href="https://zenodo.org/record/7000190">7000190</uri>
      <permissions>
        <copyright-statement>Matthias Schröder</copyright-statement>
        <license license-type="creative-commons-attribution" xlink:href="" xlink:type="simple">
          <license-p>This article is freely available under the J.UCS Open Content License.</license-p>
        </license>
      </permissions>
      <abstract>
        <label>Abstract</label>
        <p>Countably based filter spaces have been suggested in the 1970's as a model for recursion theory on higher types. Weak limit spaces with a countable base are known to be the class of spaces which can be handled by the Type-2 Model of Effectivity (TTE). We prove that the category of countably based proper filter spaces is equivalent to the category of countably based weak limit spaces. This result implies that filter spaces form yet another category from which the category of qcb-spaces inherits its cartesian closed structure. Moreover, we compare the aforementioned categories to other categories of spaces relevant to computability theory.</p>
      </abstract>
    </article-meta>
  </front>
</article>
