Numbers
Unlike the logic, the numerical applications of Laws of Form use
different structures as well as different axioms. The first approach
holds true to the boundary structures of the logic while the other
deviates from the simplicity of the form by introducing boundary types
(i.e. distinctions among distinctions).
Spencer-Brown's approach was to restrict the law of calling and to
introduce distribution as an axiom (in the logic, distribution is a
theorem).
Universe Transfer Reflexion Null Power |
|
( ( ) ) ( ( A B ) ( A C ) ) ( ( A ) ) ( ) : A |
= = = = |
A ( ( B ) ( C ) ) A ( ) |
Kauffman and Engstrom have each tried to solve problems with
Spencer-Brown's numbers. Kauffman (1996) modifies Spencer-Brown's
version of the natural numbers by restricting null power to odd spaces
and transfer to even spaces, thus eliminating the need for the
ill-defined colon. Engstrom (1996) takes a similar tactic,
restricting the application of transfer to prevent invalid
distributions.
James's solution (1993), in contrast, is to introduce new boundary
types. A subset of these types map onto the even-odd distinction
offered by Kauffman, above, but extend the numerical representation
well beyond the natural numbers.
This algebra uses three types of boundaries: two that are each
other's inverse and a third that acts as the spatial inverse. These
three forms are sufficient to build forms that map onto real, complex,
and transcendental numbers.
Standard Notation
0 1 i Pi
a -a 1 / a
a + b a - b a * b a / b
a ^ b a ^ (-b) log_b(a) | |
Boundary Notation
( ) [ < ( ) > ]
a < a > ( < [ a ] > )
a b a < b > ( [ a ] [ b ] ) ( [ a ] < [ b ] > )
( ( [ [ a ] ] [ b ] ) ) ( ( [ [ a ] ] [ < b > ] ) )
( [ [ a ] ] < [ [ b ] ] > ) |
James's first four axioms mirror define logic when the
boundary types are made identical.
The inversion axiom carries the
system beyond natural numbers but in doing so it introduces problems
associated with infinity, division by zero, and phase redundancy.
Dominion Involution1 Involution2 Distribution Inversion |
|
A [ ] ( [ A ] ) [ ( A ) ] A [ ( B ) ( C ) ] A < A > |
= = = = = |
[ ] A A [ ( A B ) ( A C ) ]
|
The first four axioms define a logical system when the two
boundaries are made identical. Otherwise, they form natural numbers
as with Spencer-Brown's system above. The Inversion axiom
extends this system from the natural numbers to integers when used at
zero depth, to rationals when used one level deep, and to irrationals
when used otherwise.
The inversion axiom carries the
system beyond natural numbers but in doing so it introduces problems
associated with infinity, division by zero, and phase redundancy.
Imaginary Logic
The laws of the logical arithmetic do not preclude additional elements
in the system. In particular, there can be an element @ such
that the following equality holds:
@ = ( @ )
Such an element leads to a contradiction with the real axiom set.
We can relax Bricken's axiom set by replacing pervasion, which
enforces the law of the excluded middle, with a distribution axiom or
an occultation rule as in the following set:
Dominion Involution Occultation |
|
A ( ) ( ( A ) ) ( ( A ) B ) A |
= = = |
( ) A A |
Other formulations of imaginary logic have four or more values,
rather than three shown above.
Knots
Kauffman has shown a mapping between distinction laws and knot
theory. In knot theory, string crossings draw a distinction:
Knot theory classifies equivalent knots with unravelling rules based
on where these crossings occur. These rules are variations on
calling, crossing, and distribution of the other forms.
| Idempotency |
|
 |
 |
 |
| Crossing |
|
 |
 |
 |
| Distribution |
|
 |
 |
 |
Copyright © 2000-2004 by
Richard Shoup,
all rights reserved.