<?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-011-12-1945</article-id>
      <article-id pub-id-type="publisher-id">28521</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.4.1 - Mathematical Logic</subject>
        </subj-group>
      </article-categories>
      <title-group>
        <article-title>Axiomatic Classes of Intuitionistic Models</article-title>
      </title-group>
      <contrib-group content-type="authors">
        <contrib contrib-type="author" corresp="yes">
          <name name-style="western">
            <surname>Goldblatt</surname>
            <given-names>Robert</given-names>
          </name>
          <email xlink:type="simple">rob.goldblatt@vuw.ac.nz</email>
          <xref ref-type="aff" rid="A1">1</xref>
        </contrib>
      </contrib-group>
      <aff id="A1">
        <label>1</label>
        <addr-line content-type="verbatim">Victoria University of Wellington, , New Zealand</addr-line>
        <institution>Victoria University of Wellington</institution>
        <country>New Zealand</country>
      </aff>
      <author-notes>
        <fn fn-type="corresp">
          <p>Corresponding author: Robert Goldblatt (<email xlink:type="simple">rob.goldblatt@vuw.ac.nz</email>).</p>
        </fn>
        <fn fn-type="edited-by">
          <p>Academic editor: </p>
        </fn>
      </author-notes>
      <pub-date pub-type="collection">
        <year>2005</year>
      </pub-date>
      <pub-date pub-type="epub">
        <day>28</day>
        <month>12</month>
        <year>2005</year>
      </pub-date>
      <volume>11</volume>
      <issue>12</issue>
      <fpage>1945</fpage>
      <lpage>1962</lpage>
      <uri content-type="arpha" xlink:href="http://openbiodiv.net/6CE4CEAD-E5E3-5895-AB1E-94C32E5FFD64">6CE4CEAD-E5E3-5895-AB1E-94C32E5FFD64</uri>
      <uri content-type="zenodo_dep_id" xlink:href="https://zenodo.org/record/6996912">6996912</uri>
      <permissions>
        <copyright-statement>Robert Goldblatt</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>A class of Kripke models for intuitionistic propositional logic is 'axiomatic' if it is the class of all models of some set of formulas (axioms). This paper discusses various structural characterisations of axiomatic classes in terms of closure under certain constructions, including images of bisimulations, disjoint unions, ultrapowers and 'prime extensions'. The prime extension of a model is a new model whose points are the prime filters of the lattice of upwardly closed subsets of the original model. We also construct and analyse a 'definable' extension whose points are prime filters of definable sets. A structural explanation is given of why a class that is closed under images of bisimulations and invariant under prime/definable extensions must be invariant under arbitrary ultrapowers. This uses iterated ultrapowers and saturation.</p>
      </abstract>
    </article-meta>
  </front>
</article>
