<?xml version="1.0" encoding="UTF-8"?>
<collection xmlns="http://www.loc.gov/MARC21/slim">
 <record>
  <leader>     caa a22        4500</leader>
  <controlfield tag="001">469033886</controlfield>
  <controlfield tag="003">CHVBK</controlfield>
  <controlfield tag="005">20180323132751.0</controlfield>
  <controlfield tag="007">cr unu---uuuuu</controlfield>
  <controlfield tag="008">170328e19920301xx      s     000 0 eng  </controlfield>
  <datafield tag="024" ind1="7" ind2="0">
   <subfield code="a">10.1007/BF01276438</subfield>
   <subfield code="2">doi</subfield>
  </datafield>
  <datafield tag="035" ind1=" " ind2=" ">
   <subfield code="a">(NATIONALLICENCE)springer-10.1007/BF01276438</subfield>
  </datafield>
  <datafield tag="100" ind1="1" ind2=" ">
   <subfield code="a">Lynch</subfield>
   <subfield code="D">James</subfield>
   <subfield code="u">Department of Mathematics and Computer Science, Clarkson University, 13699-5815, Potsdam, NY, USA</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="245" ind1="1" ind2="4">
   <subfield code="a">The quantifier structure of sentences that characterize nondeterministic time complexity</subfield>
   <subfield code="h">[Elektronische Daten]</subfield>
   <subfield code="c">[James Lynch]</subfield>
  </datafield>
  <datafield tag="520" ind1="3" ind2=" ">
   <subfield code="a">For every nondeterministic Turing machineM of time complexityT(n), there is a second-order sentence σ of a very restricted form, whose set of finite models encodes the set of strings recognized byM. Specifically, σ has a relational symbol which is interpreted as addition restricted to finite segments of the natural numbers, and a prefix consisting of existentially quantified unary second-order variables followed by a universal-existential first-order part. Here, every input stringx is encoded by a model of sizeT(|x|). Using a closely related encoding of strings as models where the size of the model is the length of the string, a consequence is that ifT(n)=n d, then there is a sentence with a similar prefix but whose second-order variables ared-ary and whose finite models encode the strings accepted byM. Potential applications to low-level complexity are discussed.</subfield>
  </datafield>
  <datafield tag="540" ind1=" " ind2=" ">
   <subfield code="a">Birkhäuser Verlag, 1992</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">nondeterministic time complexity</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">finite models</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">secondorder logic</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">68Q15</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">03C13</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="773" ind1="0" ind2=" ">
   <subfield code="t">computational complexity</subfield>
   <subfield code="d">Birkhäuser-Verlag</subfield>
   <subfield code="g">2/1(1992-03-01), 40-66</subfield>
   <subfield code="x">1016-3328</subfield>
   <subfield code="q">2:1&lt;40</subfield>
   <subfield code="1">1992</subfield>
   <subfield code="2">2</subfield>
   <subfield code="o">37</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2="0">
   <subfield code="u">https://doi.org/10.1007/BF01276438</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.1007/BF01276438</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">Lynch</subfield>
   <subfield code="D">James</subfield>
   <subfield code="u">Department of Mathematics and Computer Science, Clarkson University, 13699-5815, Potsdam, NY, USA</subfield>
   <subfield code="4">aut</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">computational complexity</subfield>
   <subfield code="d">Birkhäuser-Verlag</subfield>
   <subfield code="g">2/1(1992-03-01), 40-66</subfield>
   <subfield code="x">1016-3328</subfield>
   <subfield code="q">2:1&lt;40</subfield>
   <subfield code="1">1992</subfield>
   <subfield code="2">2</subfield>
   <subfield code="o">37</subfield>
  </datafield>
  <datafield tag="900" ind1=" " ind2="7">
   <subfield code="a">Metadata rights reserved</subfield>
   <subfield code="b">Springer special CC-BY-NC licence</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-springer</subfield>
  </datafield>
 </record>
</collection>
