#### 1

Test of the transcription functions for handling more complex pages of manuscripts in the enhanced version of FromThePage using

Note that the each encoding of a formula starts with a start and stop command so that FromThePage knows to interpret what is found between those commands as a

The start command is two braces ({{), followed by tex: The stop command is :tex, followed by two braces (}}). Click on the transcribe command above to see how they are embedded in this text for each formula and diagram.

(1) Mathematical formula

(2) Logical diagrams (Existential Graphs of C.S. Peirce)

(3) Chemical diagram and formula

#### 3

2

Use ligature in place of juncture throughout

Ladies and Gentlemen

At the end of the last lecture I gave a rule for positively ascertaining whether a graph is alphapossible or not. It also ~~furnishes~~ a description of the state of things in which it is possible. I said I supposed it was not the best possible rule; but it is reasonably speedy. Considering that the system of existential graphs is not intended to be used as a calculus, it satisfies all requirements

The idea of that was double corresponding to two different distinctions among the six

#### 4

4

fundamental alpha permissible operations. Namely of these six, there are three that complicate the graph and three that simplify it. The three that complicate is are insertion, iteration and the making of a double cut. The three that simplify it are erasure, deiteration, and the cancelling of a double cut. Furthermore these are of the six operations, two only that are not reversable, that is which may not be ~~undone ~~ as well as done. These are erasure and insertion. Now my idea in drawing up the rule was in the first place, to to define to myself precisely on what occasions the complicating operations might be indispensable in ascertaining whether a graph was possible or not, and to restrict their virtual employment to these cases, and in the second place, so to modify the non-reversible operations