A sentence Dpq that uses a Sheffer’s alternative is false only if both p and q are true. In 1925, J. Łukasiewicz simplified Nicod’s axiom from which all theses of propositional logic can be derived. Transform the Nicod-Łukasiewicz axiom into an infix parenthesized sentence and build a binary tree for it. The axiom is DDpDqrDDsDssDDsqDDpsDps.
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.