Problems of associativity: A simple proof for the lattice property of systems ordered by a semi-associative law

Samuel Huang, Dov Tamari
<span title="">1972</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="" style="color: black;">Journal of combinatorial theory. Series A</a> </i> &nbsp;
The notions of right bracketing and its associated bracketing function or family of sets lead to a short proof of the latticeproperty of (T, , -+), the system of binary bracketings ordered by a semi-associative law. 1 "Bracket" is used synonymously for "pair of parentheses" and "openings" ("closings") for "opening (closing) parentheses". 7
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="">doi:10.1016/0097-3165(72)90003-9</a> <a target="_blank" rel="external noopener" href="">fatcat:kodv3gf4ovhxxkjdt5alt2jdzi</a> </span>
<a target="_blank" rel="noopener" href="" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href=""> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> </button> </a>