jsfisher
ETcorngods survivor
- Joined
- Dec 23, 2005
- Messages
- 24,532
12-year-old Bowmore single malt from Islay.
Yeah gotta love that island.
12-year-old Bowmore single malt from Islay.
Actually, I think you misinterpreted his gibberish. Hard to believe, but true. His comment that 1 = 0.999... was loosely qualified by his patented "in Standard Mathematics...".
None of that matters, however, since his paper begins with all sorts of false statements about positional notation for numbers. Anything that follows from a false premise is irrelevant.
Then again, if P is your false premise, and since ~P can be false, and ~~P is the same as P, the premise must never have been false in the first place.
QED. Quod erat Doron.
If it was good whisky, all is forgiven.
Remember
Thus that “1” “Identity” is not “0” “Identity” can be found “Under isolator alone” by your own assertion. Try at least to keep up with your own C.R.A.P. Doron
Elements holds the id-names of the thinks of some system, where relations are not the ids, but exactly the linkage between them, for example:
Code:"=" ≠ "≠" |________________| =
where the relations =,≠ are not the elements (ids) "=","≠"
“The linkage is "linkage"”? What the heck are you on about now?
Doron, you cannot comprehend the concept of monadic operator (aka unary operator) can you?
You still have S and ~S independent of each other. Still useless.
Ah, the utility of quotation marks.
The concept designated by the equal sign, =, ceases to be a relation when it becomes the object of a relation. The object of the relation = for example.
But what I'm asking about is this very juggling that can transform a relation into an object of a relation, and an object of a relation into a relation.
How is that possible?
And how about when we are manipulating a concept that is a relation itself by another relation without denying that the first concept is a relation?
That would be some kind of organic complexity wouldn't it?
We are always making these realtions to elements, elements to relations exchanges and hiarchies.
It seems to me that there is nothing that is a fixed relation or a fixed element. No fixed non-local elements or fixed non-local relations, and no fixed non-local concepts.
The essential feature of non-locality is that it has no concepts belonging and fixed to it. It has no landscape of features prior to the manipulations of analytic and discursive thought.
The utility of the bowl is its empty space.
Monadic operator is not researchable , because you need at least S and ~S in order to get a result.
~S and S are exactly NXOR\XOR Logic.
I notice you've avoided commenting on this:
No, if they are totally isolated then you simply cannot compare them in order to know that they are not the same
Under isolator alone 1≠0, 1 or 0 identities are ignored (because they are totally isolated).
So, the answer to my question is, no, you cannot comprehend monadic operators. Thanks.
QED.
P NOT-P
F T
T F
Monadic operator is not researchable
Curiously, there is that monadic operator embedded in your statement. Your statement denies itself.
Useless.
QED.
You are the onw how wrote "linkage" in http://www.internationalskeptics.com/forums/showpost.php?p=5333141&postcount=6944 , remember?
The linkage is "linkage"...
jsfisher what is exactly monadic in ?:
Code:P NOT-P F T T F
Then your claim of “Under isolator alone 1≠0”
Is simply wrong, by your own assertions. Please let us know when to can at least agree with yourself (I doubt anyone is expecting it any time soon).
x ≠ x
|________________|
=
x ≠ x
x x
|________________|
=
Well, assuming that was meant to be the truth table for the monadic operator NOT, and "P" and "NOT-P" were intended as column headings for the table, and the values under the "P" column heading were the possible operands for the monadic operator NOT, and the values under the "NOT-P" column being the results of applying the monadic operator NOT to the corresponding operand in the adjacent column, then, in answer to your question of "what is exactly monadic", I'd respond:
The operator NOT is monadic.
I had thought that was clear.
x is a place holder for some id.
This one framework can be representend as:
Code:x ≠ x |________________| =
Avoid the Connector, and nothing is compareable bcause of total isolation:
Code:x ≠ x
Avoid the Isolator, and nothing is compareable bcause of total connectivity:
Code:x x |________________| =
Under isolator alone 1≠0, 1 or 0 identities are ignored (because they are totally isolated).
No, if they are totally isolated then you simply cannot compare them in order to know that they are not the same
By single state (monadic, as you call it) you cannot get any researchable result, because nothing is reseachable if you cannot compare.
This is exactly the reason that you need at least P and NOT-P in order to conclude something about NOT.
P NOT-P
T F
F T