Nonsense. All you did in that document is make meaningless statements as you renamed things that didn't need to be renamed.
The main principle here is very simple:
Any given collection of logical connectives is reduced into common (invariant under exchange) \ non-common (variant under exchange) relations.
We know that the fundamental property of Symmetry is its invariance, and the fundamental property of Asymmetry is its variance.
By using Symmetry on 2-valued logic, we have noticed that NXOR connective is the symmetrical state of A,B pair , where XOR is the asymmetrical state of A,B pair.
Let a 2-valued framework be represented by A B.
A B relation is:
A B
A A
A B
B A
B B
These relations can be reduced (without a loss of generality) to
symmetric (AA or BB) \ asymmetric (AB or BA) relations, represented as:
AB
XX is AB symmetry --> A=B (AB is the same)
XY is AB asymmetry --> A≠B (AB is not the same)
A=B can be reduced (without a loss of generality) to a single value X.
A≠B cannot be reduced to a single value without a loss of detail X or Y.
Furthermore, in order to conclude that A≠B, they must share the same realm.
So 2-valued framework is at least X (symmetry or sameness) \ XY (asymmetry or difference) relation.
Let us use SA (Symmetry\Asymmetry relation) on 2-valued Logic:
T F NXOR
F F considered
F T not considered
T F not considered
T T considered
T F XOR
F F not considered
F T considered
T F considered
T T not considered
T F NXOR\XOR
F F considered
F T considered
T F considered
T T considered
T F generalization of NXOR\XOR
X X considered (Symmetry)
X Y considered (Asymmetry)
Here is my personal favorite, by the way:
doronshadmi said:
Let A be {x} (represented by {.})
Why not just represent it as {x}? For that matter, why did you even bother since you never referred back to either representation?
Well English, as you have probably noticed, is not my first language so by representation I mean a particular value in this case , where x is used here as a variable.
Be that as it may, let's explore that document a little. Assume we have the four elements,
a,
b,
c, and
d with relationships
in and
out defined as follows:
Code:
[FONT="Courier New"] in out
+---+---
a | 0 | 0
b | 0 | 1
c | 1 | 0
d | 1 | 1[/FONT]
What would be your underlying System Z? Be explicit. Is
a an element of the resulting set? Is
d?
This is system Z, which is the outcome of Symmetry\Asymmetry relation:
T F generalization of NXOR\XOR
X X considered
X Y considered
As can be seen, True\False are generalized to Symmetry\Asymmetry relation.
Some examples of a,b,c,d membership with system Z:
The truth table of OR membership:
in out
0 0 --> F (a is not considered)
0 1 --> T (in , out are not the same) = { }_ (b is out Z (b is local))
1 0 --> T (in , out are not the same) = {_} (c is in Z (c is local))
1 1 --> T (in , out are the same) = {_
}_ (d is in AND out Z (d is non-empty non-local))
In this case the non-local membership is non-empty, and the local membership is empty or
non-empty. The empty non-local membership is ignored.
The truth table of AND membership:
in out
0 0 --> F (a is not considered)
0 1 --> F (b is not considered)
1 0 --> F (c is not considered)
1 1 --> T (in , out are the same) = {_
}_ (d is in AND out Z (d is non-empty non-local))
In this case the non-local membership is non-empty. The local memberships and the empty non-local membership are ignored.
The truth table of NOR membership:
in out
0 0 --> T (in , out are the same) = { } (a is in NOR out Z (a is empty non-local))
0 1 --> F (b is not considered)
1 0 --> F (c is not considered)
1 1 --> F (d is not considered)
In this case the non-local membership is empty. The local memberships and the non-empty non-local membership are ignored.
The truth table of NAND membership:
in out
0 0 --> T (in , out are the same) = { } (a is in NOR out Z (d is empty non-local))
0 1 --> T (in , out are not the same) = { }_ (b is out Z (b is local))
1 0 --> T (in , out are not the same) = {_} (c is in Z (c is local))
1 1 --> F (d is not considered)
The non-empty non-local membership is ignored.
The truth table of NXOR\XOR membership:
in out
0 0 --> T (in , out are the same) = { } (a is in NOR out Z (d is empty non-local))
0 1 --> T (in , out are not the same) = { }_ (b is out Z (b is local))
1 0 --> T (in , out are not the same) = {_} c is in Z (c is local))
1 1 --> T (in , out are the same) = {_
}_ (d is in AND out Z (d is non-empty non-local))
The truth table of NO membership:
in out
0 0 --> F (a is not considered)
0 1 --> F (b is not considered)
1 0 --> F (c is not considered)
1 1 --> F (d is not considered)