I am going to approach this from
a non-numeric perspective. In 1969 G. Spencer Brown authored a book titled Laws
of Form. In the book Spencer Brown lays out ideas behind the calculus of
indications, a primary non-numerical arithmetic and algebra. I’m not going to
go into a detailed explanation of the calculus he discovered (invented?). You
may already be aware of his work but in the event you’re not, his book is still
in publication and there’s lots of commentary available on the internet.
I have noted with footnotes where
I am quoting LOF verbatim. Unquoted definitions, theorems, instructions etc.
are my own extensions to the calculus, introduced in order to facilitate the
discussion.
“Definition
Distinction is the perfect continence.
That is to say, a distinction is
drawn by arranging a boundary with separate sides so that a point on one side
cannot reach the other side without crossing the boundary.”[1]
“Construction
Draw a distinction.”[2]
“Knowledge
Let a state distinguished by the distinction be marked with
a mark
┐
of distinction.”[3]
Assignment
Call the mark a cross.
“Arrangement
Call the form of a number of
crosses [tokens] considered with regard to one another (that is to say,
considered in the same form) an arrangement.”[4]
“Expression
Call any arrangement intended as an
indicator an expression.”[5]
“Axiom 1: The Law of Calling
The value of a call made again is
the value of the call.”[6]
Length
Length is a state of an expression and is given by the
number of crosses that comprise the expression, denoted by L(e).
“Value
Call a state indicated by an expression the value of the
expression.”[7]
Expressions of unequal lengths are unequal in value. That is
to say,
If
L(ei)
≠ L(ej) then ei
≠
ej
“Equivalence
Call expressions of the same value equivalent.
Let a sign
Let a sign
=
of equivalence be written between equivalent expressions.”[8]
Initial
1: Number
┐= ┐┐(expansion)
and
┐┐=
┐(contraction)
Repeated applications of Initial 1 (expansion) will create
forms of increasing length indefinitely.
|
┐
|
=
|
┐┐
|
|
┐┐
|
=
|
┐┐┐
|
|
┐┐┐
|
=
|
┐┐┐┐
|
|
|
…
|
|
I1
I1
I1
Call the set
created
by indefinitely invoking Initial 1 on each form in the list the set of Natural Expressions
[Ne].
Question:
Is
it possible to list the elements of [Ne]
such that no element will be missing from the list?
Given:
The
first distinction ┐
“Theorem 1: Form
The form of any finite cardinal number of crosses can be
taken as the form of an expression.
That is to say, any conceivable arrangement of any integral number
of crosses can be constructed from a simple expression by the initial steps of
the calculus.”[9]
The proof of Theorem 1 is given in the text of LOF so I
won’t repeat it here. What’s important to note is that using Initial 1 in
conjunction with Theorem 1 it is possible to construct an expression the form
of which is a member of [Ne]
but
will never appear in the listing of [Ne].
Theorem
2: Incompleteness
An attempt to list the elements of [Ne] must
be incomplete.
That is to say, it is possible to construct an element ω of [Ne] such
that ω
will
never appear in the list of [Ne]
no
matter how long the list grows.
Proof:
The
element ω
of [Ne] is
constructed as follows:
List the elements of [Ne]
one
above the other. After each element is listed apply Initial 1 to it to expand its
length and append it to ω.
Since ω is a single
expression the length of which grows over time as the listing of [Ne]
proceeds, the length of ω will grow at a rate
such that it will always exceed the length of any expression in the listing of [Ne].
|
e
|
ω
|
|
┐
|
┐┐
|
|
┐┐
|
┐┐┐┐┐
|
|
┐┐┐
|
┐┐┐┐┐┐┐┐┐
|
|
┐┐┐┐
|
┐┐┐┐┐┐┐┐┐┐┐┐┐┐
|
|
…
|
…
|
ω = ┐┐┐┐┐┐┐┐┐┐┐┐┐┐after 4 elements of [Ne] have been listed.
It’s clear that no matter how long the listing process goes
on that ω, an element of [Ne]
will never be an expression that appears in the listing of the elements of [Ne].
Since ω will never appear in
the list, the list will always be incomplete which proves Theorem 2.
“Third canon.
Convention of substitution
In any expression, let any arrangement be changed for an
equivalent arrangement.
Step
Call any such change a step.
Let a sign
Stand for the words
is
changed to.”[10]
Using the convention of substitution we can now substitute
the arrangement of symbols representing the natural numbers for crosses in
expressions of the form according the following rule.
Rule
of substitution
Let an expression of the form be substituted by a natural
number such that the value of the natural number is equal to the length of the
expression, so that:
|
┐
|
|
1
|
|
┐┐
|
|
2
|
|
┐┐┐
|
|
3
|
|
|
…
|
|
We can now expand the substitution of number for expression
to include ω
|
e
|
ω
|
|
┐
|
┐┐
|
|
┐┐
|
┐┐┐┐┐
|
|
┐┐┐
|
┐┐┐┐┐┐┐┐┐
|
|
┐┐┐┐
|
┐┐┐┐┐┐┐┐┐┐┐┐┐┐
|
|
…
|
…
|
|
n
|
ω
|
|
1
|
2
|
|
2
|
23
|
|
3
|
234
|
|
4
|
2345
|
|
…
|
…
|
ω = 2345
In both cases as the listing of each set continues ω will never appear in
the list. Consequently both the non-numeric and numeric lists will always be
incomplete.
[1]
Laws of Form, G. Spencer Brown page 1
[2]
Laws of Form, G. Spencer Brown page 3
[3]
Laws of Form, G. Spencer Brown page 4
[4]
Laws of Form, G. Spencer Brown page 4
[5]
Laws of Form, G. Spencer Brown page 4
[6]
Laws of Form, G. Spencer Brown page 1
[7]
Laws of Form, G. Spencer Brown page 5
[8]
Laws of Form, G. Spencer Brown page 5
[9]
Laws of Form, G. Spencer Brown page 12
[10]
Laws of Form, G. Spencer Brown page 8