<?xml version="1.0" encoding="UTF-8"?>
<collection xmlns="http://www.loc.gov/MARC21/slim">
 <record>
  <leader>     caa a22        4500</leader>
  <controlfield tag="001">388038802</controlfield>
  <controlfield tag="003">CHVBK</controlfield>
  <controlfield tag="005">20180307125015.0</controlfield>
  <controlfield tag="007">cr unu---uuuuu</controlfield>
  <controlfield tag="008">161130e199812  xx      s     000 0 eng  </controlfield>
  <datafield tag="024" ind1="7" ind2="0">
   <subfield code="a">10.2307/2586648</subfield>
   <subfield code="2">doi</subfield>
  </datafield>
  <datafield tag="024" ind1="7" ind2="0">
   <subfield code="a">S0022481200014237</subfield>
   <subfield code="2">pii</subfield>
  </datafield>
  <datafield tag="035" ind1=" " ind2=" ">
   <subfield code="a">(NATIONALLICENCE)cambridge-10.2307/2586648</subfield>
  </datafield>
  <datafield tag="100" ind1="1" ind2=" ">
   <subfield code="a">Kohlenbach</subfield>
   <subfield code="D">Ulrich</subfield>
   <subfield code="u">Brics, Department of Computer Science, University of Århus, NYMunkegade, DK-8000 Århus C, Denmark. E-mail: kohlenb@brics.dk</subfield>
  </datafield>
  <datafield tag="245" ind1="1" ind2="0">
   <subfield code="a">Relative constructivity</subfield>
   <subfield code="h">[Elektronische Daten]</subfield>
   <subfield code="c">[Ulrich Kohlenbach]</subfield>
  </datafield>
  <datafield tag="520" ind1="3" ind2=" ">
   <subfield code="a">In a previous paper [13] we introduced a hierarchy (G n A ω ) n∈ℕ of subsystems of classical arithmetic in all finite types where the growth of definable functions of G n A ω corresponds to the well-known Grzegorczyk hierarchy. Let AC-qf denote the schema of quantifier-free choice. [11], [13], [8] and [7] study various analytical principles Γ in the context of the theories GnA ω + AC-qf (mainly for n = 2) and use proof-theoretic tools like, e.g., monotone functional interpretation (which was introduced in [12]) to determine their impact on the growth of uniform bounds Φ such that which are extractable from given proofs (based on these principles Γ) of sentences Here A 0(u, k, v, w) is quantifier-free and contains only u, k, v, w as free variables; t is a closed term and ≤ p is defined pointwise. The term ‘uniform bound' refers to the fact that Φ does not depend on v ≤ p tuk (see [12] for the relevance of such uniform bounds in numerical analysis and for concrete applications to approximation theory).</subfield>
  </datafield>
  <datafield tag="540" ind1=" " ind2=" ">
   <subfield code="a">Copyright © Association for Symbolic Logic 1998</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/4(1998-12), 1218-1238</subfield>
   <subfield code="x">0022-4812</subfield>
   <subfield code="q">63:4&lt;1218</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/2586648</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/2586648</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">100</subfield>
   <subfield code="E">1-</subfield>
   <subfield code="a">Kohlenbach</subfield>
   <subfield code="D">Ulrich</subfield>
   <subfield code="u">Brics, Department of Computer Science, University of Århus, NYMunkegade, DK-8000 Århus C, Denmark. E-mail: kohlenb@brics.dk</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/4(1998-12), 1218-1238</subfield>
   <subfield code="x">0022-4812</subfield>
   <subfield code="q">63:4&lt;1218</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>
