# 3

### Facsimile

### Transcription

and I do not know that there is any other way 2

than that the proposition should relate immedi-

ately to a replica of the graph, considered as

such. Accordingly, all the graphs

of graphs are strictly graphs of graph replicas

and parts of graph replicas. I here introduce

you to the following list of those that I shall

have early occasion to use. Others will be

mentioned soon. Here is the list:

-A is the sheet

-B is a point of the points

-C - is area of

-[Greek letter mu?] is a blank -[unknown symbol?] is a line whose [illegible]

-[unknown symbol?] is coreplica with

ots its equivalents

-K is an enclosure -[unknown symbol?] is a graph replica

g [shown in a circle] the rules of logic of graphs

do not require g to be true

-w is a dot

w is a point to identify

## Notes and Questions

Nobody has written a note for this page yet

Please sign in to write a note for this page