Little 10 Toes
Master Poster
2b or ( | OR [] ) 2b. That is ( | AND []) the question. 
It is very useful, since only NOT is an isolation of things form each other such that there is no connection between them, for example:
X is a place holder for an element and we have only NOT framework:
... X NOT X NOT X NOT X NOT ...
In the only NOT system any X is totally isolated and there is no framework.
In an only YES system we also do not have a framework, as follows:
X is a place holder for an element and we have only YES framework:
... X YES X YES X YES X YES ...
In the only YES system any X is totally connected and there is no framework.
So the minimal useful framework is X that is comparable by connection, such that X is not total isolation and the connector is not total connection.
All along this thread I am talking about a researchable framework, which is weaker than total connectivity (only YES state) and stronger than total isolation (only NOT state).
Also classical Logic is based on YES\NOT linkage, but classical logicians are focused only on the weak NOT side of YES\NOT linkage, without ask themselves how it is possible to compare X with NOT-X, in the first place.
OM asks this question, and the answer is the weak YES side of YES\NOT linkage, which enables the comparison of X with NOT-X, in order to conclude that X in not NOT-X.
The logic of YES under YES\NOT linkage is a weak version of only-Sameness (total connectivity).
The logic of NOT under YES\NOT linkage is a weak version of only-Difference (total isolation).
No total state is a researchable framework, but in Classical Logic the logicians are using NOT without the understanding that they are actually using the weak version of NOT, which is weak exactly because it is under YES\NO linkage logical framework.
So once again:
Total NOT is resulted at least as a point.
Total YES is resulted at least as an endless (edgeless) straight Line.
No one of these total states is researchable (a point in itself is too weak and a line in itself is too strong).
Only a segment (ray is included) is researchable exactly because it is the result of YES\NO linkage logical framework, such that the NOT aspect of the linkage is transparent to the line aspect of the linkage (and we have the connection of X with NOT-X that enables the comparison under YES\NOT linkage) and the NOT aspect of the linkage is sealed to the point aspect of the linkage (and we have the isolation of X from NOT-X that enables the identity under YES\NOT linkage).
If the YES aspect of YES\NOT linkage is dominant, then we have superposition of Ids.
If the NOT aspect of YES\NOT linkage is dominant, then we have unique Ids.
Organic Numbers express exactly this.
The Man said:Again “Not” is a logical connective
P NOT-P NOT-XOR
F F T (NOT-Local)
F T F (Local)
T F F (Local)
T T T (NOT-local)
P NOT-P XOR
F F F (NOT-Local)
F T T (Local)
T F T (Local)
T T F (NOT-local)
Nagation is the result of the ability to connect between P and NOT.The Man said:It’s called negation Doron, try actually learning about it.
Let it be logical connective.
We are talking about NOT-XOR, XOR, P, NOT-P:
Also you are using "connective" without understand it.No, it is only the logical connective, NOT, that was under consideration. All the rest of your post shows you wrapped around the axle.
Given any statement in logic, call it S, there is its negation, NOT S, also a statement in logic.
Remarkably, the truth table for the NOT connective is independent of all your mumbo-jumbo. It looks like this:
[table=head]S| |NOT S| : |
truefalse| : |
falsetrue[/table]
Let it be logical connective.
We are talking about NOT-XOR, XOR, P, NOT-P:
Let P be (NOT-Local)
The Truth Table of (NOT-Local) NOT-XOR NOT-(NOT-Local) is:
As can be seen The NOT- part of NOT-XOR eliminates the NOT- part of NOT-(NOT-Local) and the result is True for F,F and T,T.Code:P NOT-P NOT-XOR F F T (NOT-Local) F T F (Local) T F F (Local) T T T (NOT-local)
The NOT-NOT enables the Semaness of Non-locality.
Let P be (Local)
The Truth Table of (Local) XOR NOT-(Local) is:
As can be seen XOR does not eliminate the NOT- part of NOT-(Local) and the result is True for F,T and T,F.Code:P NOT-P XOR F F T (NOT-Local) F T F (Local) T F F (Local) T T T (NOT-local)
The NOT enables the Difference of Locality.
Nagation is the result of the ability to connect between P and NOT.
It cannot be done without the property of connectivity, which is non-local by nature.
In general you do not understand the "connective" of "Logical connective", even if you are using it (actually, you have no choice but to use it).
Also you are using "connective" without understand it.
Without connectivity you cannot connet NOT to S in order to get NOT-S and you cannot compare between S and NOT-S.
In other words, you have no truth table for the NOT connective, without connectivity.
In that case, please define "connective".
No, it is only the logical connective, NOT, that was under consideration. All the rest of your post shows you wrapped around the axle.
Given any statement in logic, call it S, there is its negation, NOT S, also a statement in logic.
Remarkably, the truth table for the NOT connective is independent of all your mumbo-jumbo. It looks like this:
[table=head]S| |NOT S| : |
truefalse| : |
falsetrue[/table]
Well how gracious of you. However your history has demonstrated that you will still simply ignore that ‘not’ is a logical connective.
As can be seen you again simply ignore that ‘not’ is a logical connective by assigning the same value to P as you do to NOT-P.
No Doron the lacking of a difference “enables” ‘sameness’ (not sure what you mean by “Semaness” and it sounds like some personal issue for you).
Again as can be seen you simply ignore that ‘not’ is a logical connective by assigning the same value to P as you do to NOT-P.
A ‘not’ also “enables” ‘sameness’ Doron in that it is ‘not‘, well, a difference. Before you were claiming “not” “has no significance” by your “Sameness reasoning”. Now you are claiming your “sameness” (or “Semaness”) is ‘enabled’ by “The NOT-NOT” which “has no significance” by your “Sameness reasoning”. Thus your that “NOT-NOT enables the Semaness of Non-locality” depends entirely on that your “NOT enables the Difference of Locality“. So thanks again Doron for so clearly demonstrating that your “non-local” ascription is entirely dependent on your “local” ascription. Contrary to your assertions that neither one depends on (or as you put it is derived from) the other.
On the contrary, I show how NOT (without connetivity) is exactly the limit of local things.You are trying to use "NOT" without understanding it (amongst other things).
No The Man, you simply can’t understand that by double negation (P) and NOT-NOT-(P) is (P).The Man said:As can be seen you again simply ignore that ‘not’ is a logical connective by assigning the same value to P as you do to NOT-P.
The Man said:Thus your that “NOT-NOT enables the Semaness of Non-locality” depends entirely on that your “NOT enables the Difference of Locality“.
As I said (and you still can't get it) a researchable frame exists only if Sameness (connectivity) and Difference (isolation) are both its properties.
You are using the phrase “logical connective” without defining the “connective” part of this phrase.
So, this time please define “connective”.
On the contrary, I show how NOT (without connetivity) is exactly the limit of local things.
Now please define "connective".
No The Man, you simply can’t understand that by double negation (P) and NOT-NOT-(P) is (P).
You did not get the idea of "transperent".
You do not get the idea of "NOT" which is extremely, well, transparent.
The Man said:Thus your that “NOT-NOT enables the Semaness of Non-locality” depends entirely on that your “NOT enables the Difference of Locality“.
Doron you simply do not understand that P NOT-XOR NOT-P is not a double negation of P. Which again shows that you simply do not understand “NOT”.
You simply can't get http://www.internationalskeptics.com/forums/showpost.php?p=5330118&postcount=6886, because you don't know what is "connective".You are trying to use "NOT" without understanding it (amongst other things).