| 6056
within any add number of cuts. Since any graph
already scribed on the sheet of assertion can
by Permission No 2 be iterated on the sheet of assertion, that
can have another replica of it placed on the
sheet; it follows that if one replica of a graph
is on the sheet of assertion and another
replica of the same graph is oddly enclosed,
the latter can be erased. Thus,
x
can be transformed into
x
and thence
by Permission No 3 into xy. and thence
by Permission No 1 into y. [Thus?] what
the logic books call the modus ponens
it hails
gives successively
[diagrams ??] | 6056
within any add number of cuts. Since any graph
already scribed on the sheet of assertion can
by Permission No 2 be iterated on the sheet of assertion, that
can have another replica of it placed on the
sheet; it follows that if one replica of a graph
is on the sheet of assertion and another
replica of the same graph is oddly enclosed,
the latter can be erased. Thus,
can be transformed into
and thence
by Permission No 3 into xy. and thence
by Permission No 1 into y. [Thus?] what
the logic books call the modus ponens
it hails
gives successively
[diagrams ??] |