60

OverviewVersionsHelp

Facsimile

Transcription

Status: Needs Review

56

within any odd 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 is
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
it hails
it is cold . it hails

Notes and Questions

Nobody has written a note for this page yet

Please sign in to write a note for this page