17

30

having found such a lexis, iterate the entire
graph. Now in the near replica
of the graph conjoin as far as possible
the adaptible pairs. (meaning byconjoining [them consisting in joining
[as the functionesa corresponding hooks ??]) using the following
permissible operations:

1. Any graph may be iterated (with identical
junctures) within any even number of additional
enclosures.

2. Regarding a juncture as enclosed by a
cut only if every part of it is so enclosed,
every oddly enclosed juncture may be extended
outwardly, so as to be enclosed by two cuts fewer, and
every evenly enclosed cut may be retracted
inwardly so as to be enclosed by two cuts fewer.

3. Every juncture may be extended or retracted
inwardly, but since two lines of identity can

30

having found such a lexis, iterate the entire graph. Now in the near [replica ??]
of the graph conjoin as far as possible
the adaptible pairs. (meaning byconjoining [then consisting in joining ??]
[as the functionesa corresponding hooks ??]) using the following
permissible operations:

1. Any graph may be iterated (with identical
junctures) within any even number of additional enclosures.

2. Regarding a juncture as enclosed by
cut only if every part of it is so enclosed,
every oddly enclosed juncture may be extended
outwardly, so as to be enclosed by two cuts fewer [fewer ??], and
every evenly enclosed cut may be retracted
inwardly so as to be enclosed by two cuts fewer.

3. Every juncture may be extended or retracted
[inwardly ??], but since two lines of identity can