<?xml version="1.0" encoding="UTF-8"?>
<collection xmlns="http://www.loc.gov/MARC21/slim">
 <record>
  <leader>     caa a22        4500</leader>
  <controlfield tag="001">388039132</controlfield>
  <controlfield tag="003">CHVBK</controlfield>
  <controlfield tag="005">20180307125016.0</controlfield>
  <controlfield tag="007">cr unu---uuuuu</controlfield>
  <controlfield tag="008">161130e199806  xx      s     000 0 eng  </controlfield>
  <datafield tag="024" ind1="7" ind2="0">
   <subfield code="a">10.2307/2586836</subfield>
   <subfield code="2">doi</subfield>
  </datafield>
  <datafield tag="024" ind1="7" ind2="0">
   <subfield code="a">S0022481200014948</subfield>
   <subfield code="2">pii</subfield>
  </datafield>
  <datafield tag="035" ind1=" " ind2=" ">
   <subfield code="a">(NATIONALLICENCE)cambridge-10.2307/2586836</subfield>
  </datafield>
  <datafield tag="245" ind1="0" ind2="0">
   <subfield code="a">Definability and descent</subfield>
   <subfield code="h">[Elektronische Daten]</subfield>
  </datafield>
  <datafield tag="520" ind1="3" ind2=" ">
   <subfield code="a">The present note offers a short argument for the descent theorems of Zawadowski [10] (originally [9]) and Makkai [6], which were conjectured by Pitts after the descent theorem of Joyal and Tierney [3] for open geometric morphisms of (Grothendieck) toposes. The original proofs, which involve variants of Makkai's [5] duality for first order logic, are rather involved and there has been considerable interest in locating simpler proofs. Viewed categorically, the descent theorems establish a bicategorical exactness property (conservative morphisms are effective descent) for pretop (the 2-category of small pretoposes, pretopos functors, and natural transformations), for exact (exact categories, exact functors, and natural transformations), and for bpretop* (Boolean pretoposes, pretopos functors, and natural isomorphisms). Viewed logically, they fragment into a familiar Beth/Tarski-type definability theorem and a covering theorem for certain functors on PCΔ-categories (groupoids, in the Boolean case); the latter (as the former) is a arithmetical statement about the syntax of first order logic ([6, §3])). The argument here involves special models and, independently, a continuity lemma of Makkai. The use of special models is axiomatic in that only a few properties (listed below) are needed. The continuity lemma, 9.1 of [6], is established via forcing and can be read independently of the rest of that paper. Because of its interest to both the model theorist and the category theorist, the argument is first given as straight model theory and afterwards it is briefly indicated how the descent theorems follow.</subfield>
  </datafield>
  <datafield tag="540" ind1=" " ind2=" ">
   <subfield code="a">Copyright © Association for Symbolic Logic 1998</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Ballard</subfield>
   <subfield code="D">David</subfield>
   <subfield code="u">Department of Mathematics, Sonoma State University, Rohnert Park, CA, USA, E-mail: david.ballard@sonoma.edu</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Boshuck</subfield>
   <subfield code="D">William</subfield>
   <subfield code="u">Department of Mathematics and Statistics, McGill University, Montreal, PQ, Canada, E-mail: boshuck@math.mcgill.ca</subfield>
  </datafield>
  <datafield tag="773" ind1="0" ind2=" ">
   <subfield code="t">The Journal of Symbolic Logic</subfield>
   <subfield code="d">Cambridge University Press</subfield>
   <subfield code="g">63/2(1998-06), 372-378</subfield>
   <subfield code="x">0022-4812</subfield>
   <subfield code="q">63:2&lt;372</subfield>
   <subfield code="1">1998</subfield>
   <subfield code="2">63</subfield>
   <subfield code="o">JSL</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2="0">
   <subfield code="u">https://doi.org/10.2307/2586836</subfield>
   <subfield code="q">text/html</subfield>
   <subfield code="z">Onlinezugriff via DOI</subfield>
  </datafield>
  <datafield tag="908" ind1=" " ind2=" ">
   <subfield code="D">1</subfield>
   <subfield code="a">research-article</subfield>
   <subfield code="2">jats</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">856</subfield>
   <subfield code="E">40</subfield>
   <subfield code="u">https://doi.org/10.2307/2586836</subfield>
   <subfield code="q">text/html</subfield>
   <subfield code="z">Onlinezugriff via DOI</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">700</subfield>
   <subfield code="E">1-</subfield>
   <subfield code="a">Ballard</subfield>
   <subfield code="D">David</subfield>
   <subfield code="u">Department of Mathematics, Sonoma State University, Rohnert Park, CA, USA, E-mail: david.ballard@sonoma.edu</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">700</subfield>
   <subfield code="E">1-</subfield>
   <subfield code="a">Boshuck</subfield>
   <subfield code="D">William</subfield>
   <subfield code="u">Department of Mathematics and Statistics, McGill University, Montreal, PQ, Canada, E-mail: boshuck@math.mcgill.ca</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">773</subfield>
   <subfield code="E">0-</subfield>
   <subfield code="t">The Journal of Symbolic Logic</subfield>
   <subfield code="d">Cambridge University Press</subfield>
   <subfield code="g">63/2(1998-06), 372-378</subfield>
   <subfield code="x">0022-4812</subfield>
   <subfield code="q">63:2&lt;372</subfield>
   <subfield code="1">1998</subfield>
   <subfield code="2">63</subfield>
   <subfield code="o">JSL</subfield>
  </datafield>
  <datafield tag="900" ind1=" " ind2="7">
   <subfield code="b">CC0</subfield>
   <subfield code="u">http://creativecommons.org/publicdomain/zero/1.0</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="898" ind1=" " ind2=" ">
   <subfield code="a">BK010053</subfield>
   <subfield code="b">XK010053</subfield>
   <subfield code="c">XK010000</subfield>
  </datafield>
  <datafield tag="949" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="F">NATIONALLICENCE</subfield>
   <subfield code="b">NL-cambridge</subfield>
  </datafield>
 </record>
</collection>
