<?xml version="1.0" encoding='utf-8'?>
<!DOCTYPE wml PUBLIC "-//WAPFORUM//DTD WML 1.1//EN" "http://www.wapforum.org/DTD/wml_1.1.xml">
<wml>
<card id="card1" title="Substructural logic - Page 6 - Wikipedia">
<p>
<a accesskey="1" href="page.php?w=substructural_logic&amp;p=5">1.Previous</a><br />
<a accesskey="3" href="page.php?w=substructural_logic&amp;p=7">3.Next</a>
</p>
<p>They occur naturally in <a href="page.php?w=proof_theory">proof theory</a>, and were first noticed there (before receiving a name).</p>

<p><big> Premise composition </big></p>
<p>There are numerous ways to compose premises (and in the multiple-conclusion case, conclusions as well). One way is to collect them into a set. But since e.g. {a,a} = {a} we have contraction for free if premises are sets. We also have associativity and permutation (or commutativity) for free as well, among other properties. In substructural logics, typically premises are not</p><p>
<a accesskey="1" href="page.php?w=substructural_logic&amp;p=5">1.Previous</a><br />
<a accesskey="3" href="page.php?w=substructural_logic&amp;p=7">3.Next</a>
</p>

<do type="prev" label="Search">
        <go href="search.wml"/>
</do>

</card>
</wml>
