zooterkin said:
you define the operator to do something.
Exactly.
Doing something is first of all to define the must have terms that enables one to research.
By using an ontological view of this subject, things remains the same or things are different.
= is an operator, such that any given input is the same as the output.
By ontology = is called unary connective because I/O is the same.
~ is an operator, such that any given input is different than the output.
By ontology ~ is called binary connective because I/O is different.
At the level of ontology we do not care of how many inputs are given, in order to determine if the operator is unary or binary.
Furthermore, the operators = or ~ are non-local w.r.t Input or Output.
For example: in “~(=()) --> ~()” expression the ~ operator is non-local w.r.t Input =() and output ~(), where Input =() is: “Nothing is itself”, and Output ~() is: “different than Nothing” .
Please pay attention that by the non-locality of the operator w.r.t the I/O we actually define the ontological base of existence (the definition of Nothing as =() and Something as ~()).
At this fundamental level ~(~()) --> =(), which is “Nothing”, and =(~()) --> ~(), which is “Something”.
In the particular case of two valued logic we have opposite things called True and False.
Let us research what happen if = and ~ operators are used in two valued logic:
=(T) --> =T , =(F) --> =F and = is called unary operator because I/O is the same.
~(T) --> =F , ~(F) --> =T and ~ is called binary operator because I/O is different.
The last case is known as “Negation under two-values”, where the Input is different than the Output.
Two valued Logic exists by =(T,F) --> =T,=F (=F and =T exist).
Two valued Logic is eliminated by ~(T,F) --> =() (nothing).
Actually any n-valued logic exists by = operator and eliminated by ~ operator, as follows:
=(n-values) --> =n-values (=n-values exist).
~(n-values) --> =() (nothing).
If only parts of the n-values are used as inputs for ~ operator, then the output is anything but the input.
In all cases a researchable framework holds only if both Input and Output are considered under = or ~ operations.