Material nonimplication or abjunction (Latin ab = "away", junctio= "to join") is a term referring to a logic operation used in generic circuits and Boolean algebra.[1] It is the negation of material implication. That is to say that for any two propositions
P
Q
P
Q
P
Q
P
Q
P
Q
It may be written using logical notation as
P\nrightarrowQ
P\not\supsetQ
\neg(P → Q)
P\land\negQ
Material nonimplication may be defined as the negation of material implication.
P\nrightarrowQ | \Leftrightarrow | \neg(P → Q) | |
\Leftrightarrow | \neg |
In classical logic, it is also equivalent to the negation of the disjunction of
\negP
Q
P
\negQ
P\nrightarrowQ | \Leftrightarrow | \neg( | \negP | \lor | Q) | \Leftrightarrow | P | \land | \negQ | |
\Leftrightarrow | \neg( | \lor | ) | \Leftrightarrow | \land |
falsehood-preserving: The interpretation under which all variables are assigned a truth value of "false" produces a truth value of "false" as a result of material nonimplication.
The symbol for material nonimplication is simply a crossed-out material implication symbol. Its Unicode symbol is 219B16 (8603 decimal): ↛.
"p minus q."
"p without q."
"p but not q."
"q is false, in spite of p."
Bitwise operation: A&(~B)
Logical operation: A&&(!B)