 A group of weak substructural logics known as the Lambek calculi reject all structural rules, or else one or the other of either commutation or association, or possess both of these rules only. Designed by and named after Joachim Lambek, these logics were designed originally to model the syntax, or formal grammar, of natural languages (see the entry on  typelogical grammar).