# The person is plagued by Basic logic, In logic, negation, also called logical complement. The “Brahman” the person is a negation. It’s a wash: man is bedeviled 1 June 2017. Man has no voice & is muzzled. Subject to neurobiofeedback called life. Experienced as a life already lived. Man has no voice, no sense, no life, man has a spiritus “breath” if that can even be found. This is from “The Love of Ganesha JoJo” 1 June 2017

The person is plagued by Basic logic, In logic, negation, also called logical complement.
The “Brahman” the person is a negation. It’s a wash: man is bedeviled 1 june 2017

define: negation. Ref: a at&t phone cell phone call would be a negation. It does not go anywhere from the
person.
In logic, negation, also called logical complement, is an operation that takes a proposition p to another
proposition “not p”, written ¬p, which is interpreted intuitively as being true when p is false, and false
when p is true. Negation is thus a unary (single-argument) logical connective. It may be applied as an
operation on propositions, truth values, or semantic values more generally. In classical logic, negation
is normally identified with the truth function that takes truth to falsity and vice versa. In intuitionistic
logic, according to the Brouwer–Heyting–Kolmogorov interpretation, the negation of a proposition p is the
proposition whose proofs are the refutations of p.

No agreement exists as to the possibility of defining negation, as to its logical status, function, and
meaning, as to its field of applicability…, and as to the interpretation of the negative judgment,
(F.H. Heinemann 1944).[1]
Classical negation is an operation on one logical value, typically the value of a proposition,
that produces a value of true when its operand is false and a value of false when its operand is true. So,
if statement A is true, then ¬A (pronounced “not A”) would therefore be false; and conversely, if ¬A is false, then A would be true.
The truth table of ¬p is as follows:
Truth table of ¬p
p ¬p
True False
False True
Classical negation can be defined in terms of other logical operations. For example, ¬p can be defined as
p → F, where “→” is logical consequence and F is absolute falsehood. Conversely, one can define F as p & ¬p
for any proposition p, where “&” is logical conjunction. The idea here is that any contradiction is false.
While these ideas work in both classical and intuitionistic logic, they do not work in paraconsistent logic,
where contradictions are not necessarily false. But in classical logic, we get a further identity: p → q can
be defined as ¬p ∨ q, where “∨” is logical disjunction: “not p, or q”.
Algebraically, classical negation corresponds to complementation in a Boolean algebra, and intuitionistic
negation to pseudocomplementation in a Heyting algebra. These algebras provide a semantics for classical and
intuitionistic logic respectively.

Double negation
Within a system of classical logic, double negation, that is, the negation of the negation of a proposition p, is logically equivalent to p. Expressed in symbolic terms, ¬¬p ⇔ p. In intuitionistic logic, a proposition implies its double negation but not conversely. This marks one important difference between classical and intuitionistic negation. Algebraically, classical negation is called an involution of period two.
However, in intuitionistic logic we do have the equivalence of ¬¬¬p and ¬p. Moreover, in the propositional
case, a sentence is classically provable if its double negation is intuitionistically provable. This result
is known as Glivenko’s theorem.
Distributivity
De Morgan’s laws provide a way of distributing negation over disjunction and conjunction :
{\displaystyle \neg (a\vee b)\equiv (\neg a\wedge \neg b)} \neg(a \vee b) \equiv (\neg a \wedge \neg b),
and
{\displaystyle \neg (a\wedge b)\equiv (\neg a\vee \neg b)} \neg(a \wedge b) \equiv (\neg a \vee \neg b).
Linearity
In Boolean algebra, a linear function is one such that:
If there exists a0, a1, …, an {\displaystyle \in } \in {0,1} such that f(b1, …, bn) = a0 ⊕
(a1 {\displaystyle \land } \land b1) ⊕ … ⊕ (an {\displaystyle \land } \land bn), for all b1, …, bn
{\displaystyle \in } \in {0,1}.
Another way to express this is that each variable always makes a difference in the truth-value of the
operation or it never makes a difference. Negation is a linear logical operator.
Self dual
In Boolean algebra a self dual function is one such that:
f(a1, …, an) = ~f(~a1, …, ~an) for all a1, …, an {\displaystyle \in } \in {0,1}. Negation is a self
dual logical operator.
Rules of inference
There are a number of equivalent ways to formulate rules for negation. One usual way to formulate classical
negation in a natural deduction setting is to take as primitive rules of inference negation introduction
(from a derivation of p to both q and ¬q, infer ¬p; this rule also being called reductio ad absurdum),
negation elimination (from p and ¬p infer q; this rule also being called ex falso quodlibet), and double
negation elimination (from ¬¬p infer p). One obtains the rules for intuitionistic negation the same way but
by excluding double negation elimination.
Negation introduction states that if an absurdity can be drawn as conclusion from p then p must not be the
case (i.e. p is false (classically) or refutable (intuitionistically) or etc.). Negation elimination states
that anything follows from an absurdity. Sometimes negation elimination is formulated using a primitive
absurdity sign ⊥. In this case the rule says that from p and ¬p follows an absurdity. Together with double
negation elimination one may infer our originally formulated rule, namely that anything follows from an
absurdity.
Typically the intuitionistic negation ¬p of p is defined as p→⊥. Then negation introduction and elimination
are just special cases of implication introduction (conditional proof) and elimination (modus ponens).
In this case one must also add as a primitive rule ex falso quodlibet.
Programming
As in mathematics, negation is used in computer science to construct logical statements.
if (!(r == t))
{
/*…statements executed when r does NOT equal t…*/
}
The “!” signifies logical NOT in B, C, and languages with a C-inspired syntax such as C++, Java, JavaScript,
Perl, and PHP. “NOT” is the operator used in ALGOL 60, BASIC, and languages with an ALGOL- or BASIC-inspired
syntax such as Pascal, Ada, Eiffel and Seed7. Some languages (C++, Perl, etc.) provide more than one operator
for negation. A few languages like PL/I and Ratfor use ¬ for negation. Some modern computers and operating
systems will display ¬ as ! on files encoded in ASCII. Most modern languages allow the above statement to be
shortened from if (!(r == t)) to if (r != t), which allows sometimes, when the compiler/interpreter is not
able to optimize it, faster programs.
In computer science there is also bitwise negation. This takes the value given and switches all the binary
1s to 0s and 0s to 1s. See bitwise operation. This is often used to create ones’ complement or “~” in C or
C++ and two’s complement (just simplified to “-” or the negative sign since this is equivalent to taking the
arithmetic negative value of the number) as it basically creates the opposite (negative value equivalent) or
mathematical complement of the value (where both values are added together they create a whole).
To get the absolute (positive equivalent) value of a given integer the following would work as the “-”
changes it from negative to positive (it is negative because “x < 0” yields true)
unsigned int abs(int x)
{
if (x < 0)
return -x;
else
return x;
}
To demonstrate logical negation:
unsigned int abs(int x)
{
if (!(x < 0))
return x;
else
return -x;
}
Inverting the condition and reversing the outcomes produces code that is logically equivalent to the original
code, i.e. will have identical results for any input (note that depending on the compiler used, the actual
instructions performed by the computer may differ).
This convention occasionally surfaces in written speech, as computer-related slang for not. The phrase
!voting, for example, means “not voting”.

define: logic, log·ic
ˈläjik/, reasoning conducted or assessed according to strict principles of validity. : reasoning, rationale,
argument, argumentation.a system or set of principles underlying the arrangements of elements in a computer
or electronic device so as to perform a specified task.

define: plague, a contagious bacterial disease characterized by fever and delirium, typically with the
formation of buboes (see bubonic plague) and sometimes infection of the lungs. cause continual trouble or distress to.
:afflict, bedevil, torment, trouble, beset, dog, curse

bedeviled defined: (of something bad) cause great and continual trouble to. (of a person) torment or harass.
afflict, torment, beset, assail, beleaguer, plague, blight, rack, oppress, harry, curse, dog; harass, distress, trouble, worry, torture; frustrate, vex, annoy, irritate, irk
“past mistakes that continue to bedevil her”

This is from  “The Love of Ganesha JoJo” 1 June 2017

Man’s behavior is Involuntarily. “Thus saith the Lord”

# Contact CIA Agent Kale (AK) DOUGLAS LEE THOMPSON

### Submission Sent

Submission Reference ID: 745XVD54

define Brahman, see link to video: