<?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-023-06-0529</article-id>
      <article-id pub-id-type="publisher-id">23285</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.1.1 - Models of Computation</subject>
          <subject>F.1.2 - Modes of Computation</subject>
          <subject>F.4.1 - Mathematical Logic</subject>
        </subj-group>
      </article-categories>
      <title-group>
        <article-title>The Least ∑-jump Inversion Theorem for n-families</article-title>
      </title-group>
      <contrib-group content-type="authors">
        <contrib contrib-type="author" corresp="yes">
          <name name-style="western">
            <surname>Faizrahmanov</surname>
            <given-names>Marat</given-names>
          </name>
          <email xlink:type="simple">marat.faizrahmanov@gmail.com</email>
          <xref ref-type="aff" rid="A1">1</xref>
        </contrib>
        <contrib contrib-type="author" corresp="no">
          <name name-style="western">
            <surname>Kalimullin</surname>
            <given-names>Iskander</given-names>
          </name>
          <xref ref-type="aff" rid="A1">1</xref>
        </contrib>
        <contrib contrib-type="author" corresp="no">
          <name name-style="western">
            <surname>Montalban</surname>
            <given-names>Antonio</given-names>
          </name>
          <xref ref-type="aff" rid="A2">2</xref>
        </contrib>
        <contrib contrib-type="author" corresp="no">
          <name name-style="western">
            <surname>Puzarenko</surname>
            <given-names>Vadim</given-names>
          </name>
          <xref ref-type="aff" rid="A3">3</xref>
        </contrib>
      </contrib-group>
      <aff id="A1">
        <label>1</label>
        <addr-line content-type="verbatim">Kazan (Volga Region) Federal University, Kazan, Russia</addr-line>
        <institution>Kazan (Volga Region) Federal University</institution>
        <addr-line content-type="city">Kazan</addr-line>
        <country>Russia</country>
      </aff>
      <aff id="A2">
        <label>2</label>
        <addr-line content-type="verbatim">University of California, Berkeley, United States of America</addr-line>
        <institution>University of California</institution>
        <addr-line content-type="city">Berkeley</addr-line>
        <country>United States of America</country>
      </aff>
      <aff id="A3">
        <label>3</label>
        <addr-line content-type="verbatim">Novosibirsk State University, Novosibirsk, Russia</addr-line>
        <institution>Novosibirsk State University</institution>
        <addr-line content-type="city">Novosibirsk</addr-line>
        <country>Russia</country>
      </aff>
      <author-notes>
        <fn fn-type="corresp">
          <p>Corresponding author: Marat Faizrahmanov (<email xlink:type="simple">marat.faizrahmanov@gmail.com</email>).</p>
        </fn>
        <fn fn-type="edited-by">
          <p>Academic editor: </p>
        </fn>
      </author-notes>
      <pub-date pub-type="collection">
        <year>2017</year>
      </pub-date>
      <pub-date pub-type="epub">
        <day>28</day>
        <month>06</month>
        <year>2017</year>
      </pub-date>
      <volume>23</volume>
      <issue>6</issue>
      <fpage>529</fpage>
      <lpage>538</lpage>
      <uri content-type="arpha" xlink:href="http://openbiodiv.net/D37660DC-E704-5F2B-825C-B56E3E42AB1F">D37660DC-E704-5F2B-825C-B56E3E42AB1F</uri>
      <uri content-type="zenodo_dep_id" xlink:href="https://zenodo.org/record/5505257">5505257</uri>
      <history>
        <date date-type="received">
          <day>03</day>
          <month>04</month>
          <year>2017</year>
        </date>
        <date date-type="accepted">
          <day>26</day>
          <month>06</month>
          <year>2017</year>
        </date>
      </history>
      <permissions>
        <copyright-statement>Marat Faizrahmanov, Iskander Kalimullin, Antonio Montalban, Vadim Puzarenko</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>Studying the ∑-reducibility of families introduced by [Kalimullin and Puzarenko 2009] we show that for every set  there is a family of sets  which is the ∑-least countable family whose ∑-jump is ∑-equivalent to . This fact will be generalized for the class of n-families (families of families of ... of sets).</p>
      </abstract>
    </article-meta>
  </front>
</article>
