MS 455-456 (1903) - Lowell Lecture II

ReadAboutContentsHelp

Pages

46
Needs Review

46

45

term it, compounding, the definition of it in terms of permission will be

1st, predicating the definition of the definitum, if it is permitted to scribe on the sheet of assertion a replica of a compound graph, then it is permitted to scribe on the sheet of assertion a replica of either component. Or, stating this in terms of trnsformations: Any replica of a compound graph may on the sheet of assertion be transformed into a replica of either component. That is to say, under a more practical[ly] aspect, any partial graph on the sheet of assertion may be erased or cancelled.

2nd, predicating the definitum of the

Last edit over 6 years ago by gnox
47
Complete

47

This shall head our list of alpha permissions

Permission No 1. Any graph on the sheet of assertion can be erased.

Last edit over 6 years ago by gnox
48
Complete

48

46

definition; if it be permitted to scribe on the sheet of assertion a replica of which we please of two graphs then it is permitted to scribe the replica of the compound graph of which those two are the sole components. Or in terms of transformation, if it be permitted to transform the blank sheet into either we please of two graphs, it is permissible to transform it into the compound of the two. That is to say, under a more practical aspect, whatever might be scribed on the sheet of assertion were this blank, can be scribed regardless of what is already scribed. This shall be our second alpha permission.

Last edit over 6 years ago by gnox
49
Complete

49

Permission No 2. Whatever is permissively scribable on the sheet of assertion is so regardless of what is already scribed.

Last edit over 6 years ago by gnox
50
Needs Review

50

47

Let us now treat the scroll in the same way.

First, the predication of the definition with the definitum as subject is that when it is permitted to scribe upon the sheet of assertion a scroll with two graph-replicas, x and y, in its outer and in its inner close, or on its bottom and on it[s] patch, respectively, then whenever it is permitted to put the graph x upon the sheet of assertion, it will likewise be permitted to put the graph y upon the sheet of assertion. Or in terms of transformation it will be permissible on the sheet of assertion to transform x by the insertion into it of y as a component of a compound graph xy.

Last edit over 6 years ago by gnox
Displaying pages 46 - 50 of 68 in total