<?xml version="1.0" encoding="UTF-8"?>
<collection xmlns="http://www.loc.gov/MARC21/slim">
 <record>
  <leader>     caa a22        4500</leader>
  <controlfield tag="001">388039329</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/2586851</subfield>
   <subfield code="2">doi</subfield>
  </datafield>
  <datafield tag="024" ind1="7" ind2="0">
   <subfield code="a">S0022481200015097</subfield>
   <subfield code="2">pii</subfield>
  </datafield>
  <datafield tag="035" ind1=" " ind2=" ">
   <subfield code="a">(NATIONALLICENCE)cambridge-10.2307/2586851</subfield>
  </datafield>
  <datafield tag="245" ind1="0" ind2="0">
   <subfield code="a">Sequentially continuous linear mappings in constructive analysis</subfield>
   <subfield code="h">[Elektronische Daten]</subfield>
  </datafield>
  <datafield tag="520" ind1="3" ind2=" ">
   <subfield code="a">A mapping u: X → Y between metric spaces is sequentially continuous if for each sequence (xn ) converging to x ∈ X, (u(xn )) converges to u(x). It is well known in classical mathematics that a sequentially continuous mapping between metric spaces is continuous; but, as all proofs of this result involve the law of excluded middle, there appears to be a constructive distinction between sequential continuity and continuity. Although this distinction is worth exploring in its own right, there is another reason why sequential continuity is interesting to the constructive mathematician: Ishihara [8] has a version of Banach's inverse mapping theorem in functional analysis that involves the sequential continuity, rather than continuity, of the linear mappings; if this result could be upgraded by deleting the word &quot;sequential”, then we could prove constructively the standard versions of the inverse mapping theorem and the closed graph theorem. Troelstra [9] showed that in Brouwer's intuitionistic mathematics (INT) a sequentially continuous mapping on a separable metric space is continuous. On the other hand, Ishihara [6, 7] proved constructively that the continuity of sequentially continuous mappings on a separable metric space is equivalent to a certain boundedness principle for subsets of ℕ; in the same paper, he showed that the latter principle holds within the recursive constructive mathematics (RUSS) of the Markov School. Since it is not known whether that principle holds within Bishop's constructive mathematics (BISH), of which INT and RUSS are models and which can be regarded as the constructive core of mathematics, the exploration of sequential continuity within BISH holds some interest.</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">Bridges</subfield>
   <subfield code="D">Douglas</subfield>
   <subfield code="u">Department of Mathematics, University of Waikato, Hamilton, New Zealand, E-mail: douglas@waikato.ac.nz</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Mines</subfield>
   <subfield code="D">Ray</subfield>
   <subfield code="u">Department of Mathematical Sciences, New Mexico State University, Las Cruces, NM 88003, USA, E-mail: ray@nmsu.edu</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), 579-583</subfield>
   <subfield code="x">0022-4812</subfield>
   <subfield code="q">63:2&lt;579</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/2586851</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/2586851</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">Bridges</subfield>
   <subfield code="D">Douglas</subfield>
   <subfield code="u">Department of Mathematics, University of Waikato, Hamilton, New Zealand, E-mail: douglas@waikato.ac.nz</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">Mines</subfield>
   <subfield code="D">Ray</subfield>
   <subfield code="u">Department of Mathematical Sciences, New Mexico State University, Las Cruces, NM 88003, USA, E-mail: ray@nmsu.edu</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), 579-583</subfield>
   <subfield code="x">0022-4812</subfield>
   <subfield code="q">63:2&lt;579</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>
