 However, the claim of the superiority of IntElim rules has seemed to some to be either shaky or perhaps circular. Consider the case of a new binary connective, TONK, proposed in Prior (1960), whose (complete) meaning was to be given by the introduction rule: from \(\phi\) infer \((\phi\) TONK \(\psi)\), and the elimination rule: from \((\phi\) TONK \(\psi)\) infer \(\psi\). If logic rules are to be given merely in terms of some Introduction and some Elimination conditions, then TONK has just been given a proper Int-Elim definition. But as Prior notes, logic becomes much more “egalitarian” with this new connective…too egalitarian, perhaps!