A sentence that uses a Sheffer’s alternative is false only if both and are true. In 1925, J. Lukasiewicz simplified Nicod’s axiom from which all theses of propositional logic can be derived....

A sentence

that uses a Sheffer’s alternative is false only if both

and

are true. In 1925, J. Lukasiewicz simplified Nicod’s axiom from which all theses of propositional logic can be derived. Transform the Nicod-Lukasiewicz axiom into an infix parenthesized sentence and build a binary tree for it. The axiom is