16

OverviewVersionsHelp

Here you can see all page revisions and compare the changes have been made in each revision. Left column shows the page title and transcription in the selected revision, right column shows what have been changed. Unchanged text is highlighted in white, deleted text is highlighted in red, and inserted text is highlighted in green color.

3 revisions
Jannyp at Jul 31, 2020 07:53 PM

16

28

In short the difference between alpha impossibility
and beta impossibilitiy is that alpha impossibility
is implicit self contradiction violating
the principle of contradiction and therefore being
an impossibility for anything that has any kind of
being. A beta-impossibility is an impossibility
for whatever exists, so that the principle of excluded
middle holds of it, whether this existence be accomplished
or be in future.

First the A rule for finding whether a graph is
B. impossible, or if not how near it comes to that condition
what graph would have to
be [scribed??] along with is to render it so, is
as follows:

1st: Find in the graph some lexis (regarding θ as a lexis,) of
which is both one replica is oddly enclosed and
another is evenly enclosed, the latter not being
within every cut enclosing the former. Call every such pivotal spot an adaptible pair. And

16

28

In short the difference between alpha impossibility
and beta impossibilitiy is that alpha impossibility
is implicit self contradiction violating
the princiiple of contradiction and therefore being
and impossibility for anything that has any kind of
being. A beta-impossibility is an impossibility
for whatever exists, so that the principle of excluded
middle holds of it of it, whether this existence be accomplished
or be in [futisso ??].

First the A rule for finding whether a graph is
B. impossible, or if not how near it comes to that condition
[what graph ??] would have to
be [periber ??] along with is to render it so, is
as follows:

1st: Find in the graph some [lexis ??] (regarding [null set?] as a lexis,) of
which is both one [replica ??] is oddly enclosed and
another is evenly enclosed, the later not being
within every cut enclosing the former. Call every such [peice or spot ??] an [adaptible ??] pair. And