<?xml version="1.0" encoding="UTF-8"?>
<collection xmlns="http://www.loc.gov/MARC21/slim">
 <record>
  <leader>     caa a22        4500</leader>
  <controlfield tag="001">388040084</controlfield>
  <controlfield tag="003">CHVBK</controlfield>
  <controlfield tag="005">20180307125018.0</controlfield>
  <controlfield tag="007">cr unu---uuuuu</controlfield>
  <controlfield tag="008">161130e199809  xx      s     000 0 eng  </controlfield>
  <datafield tag="024" ind1="7" ind2="0">
   <subfield code="a">10.2307/2586715</subfield>
   <subfield code="2">doi</subfield>
  </datafield>
  <datafield tag="024" ind1="7" ind2="0">
   <subfield code="a">S0022481200014626</subfield>
   <subfield code="2">pii</subfield>
  </datafield>
  <datafield tag="035" ind1=" " ind2=" ">
   <subfield code="a">(NATIONALLICENCE)cambridge-10.2307/2586715</subfield>
  </datafield>
  <datafield tag="100" ind1="1" ind2=" ">
   <subfield code="a">Avron</subfield>
   <subfield code="D">A.</subfield>
   <subfield code="u">School of Mathematical Sciences, Sackxer Faculty of Exact Sciences, Tel Aviv University, Tel Aviv 69978, Israel E-mail: aa@math.tau.ac.il</subfield>
  </datafield>
  <datafield tag="245" ind1="1" ind2="0">
   <subfield code="a">Multiplicative conjunction and an algebraic meaning of contraction and weakening</subfield>
   <subfield code="h">[Elektronische Daten]</subfield>
   <subfield code="c">[A. Avron]</subfield>
  </datafield>
  <datafield tag="520" ind1="3" ind2=" ">
   <subfield code="a">We show that the elimination rule for the multiplicative (or intensional) conjunction Λ is admissible in many important multiplicative substructural logics. These include LLm (the multiplicative fragment of Linear Logic) and RMIm (the system obtained from LLm by adding the contraction axiom and its converse, the mingle axiom.) An exception is R m (the intensional fragment of the relevance logic R, which is LLm together with the contraction axiom). Let SLL m and SRm be, respectively, the systems which are obtained from LLm and Rm by adding this rule as a new rule of inference. The set of theorems of SRm is a proper extension of that of Rm , but a proper subset of the set of theorems of RMI m. Hence it still has the variable-sharing property. SRm has also the interesting property that classical logic has a strong translation into it. We next introduce general algebraic structures, called strong multiplicative structures, and prove strong soundness and completeness of SLLm relative to them. We show that in the framework of these structures, the addition of the weakening axiom to SLLm corresponds to the condition that there will be exactly one designated element, while the addition of the contraction axiom corresponds to the condition that there will be exactly one nondesignated element (in the first case we get the system BCKm , in the second - the system SRm ). Various other systems in which multiplicative conjunction functions as a true conjunction are studied, together with their algebraic counterparts.</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/3(1998-09), 831-859</subfield>
   <subfield code="x">0022-4812</subfield>
   <subfield code="q">63:3&lt;831</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/2586715</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/2586715</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">Avron</subfield>
   <subfield code="D">A.</subfield>
   <subfield code="u">School of Mathematical Sciences, Sackxer Faculty of Exact Sciences, Tel Aviv University, Tel Aviv 69978, Israel E-mail: aa@math.tau.ac.il</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/3(1998-09), 831-859</subfield>
   <subfield code="x">0022-4812</subfield>
   <subfield code="q">63:3&lt;831</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>
