
In
logic
Logic is the study of correct reasoning. It includes both formal and informal logic. Formal logic is the study of deductively valid inferences or logical truths. It examines how conclusions follow from premises based on the structure o ...
, converse nonimplication is a
logical connective
In logic, a logical connective (also called a logical operator, sentential connective, or sentential operator) is a logical constant. Connectives can be used to connect logical formulas. For instance in the syntax of propositional logic, the ...
which is the
negation
In logic, negation, also called the logical not or logical complement, is an operation (mathematics), operation that takes a Proposition (mathematics), proposition P to another proposition "not P", written \neg P, \mathord P, P^\prime or \over ...
of
converse implication
In logic and mathematics, the converse of a categorical or implicational statement is the result of reversing its two constituent statements. For the implication ''P'' → ''Q'', the converse is ''Q'' → ''P''. For the categorical proposition '' ...
(equivalently, the
negation
In logic, negation, also called the logical not or logical complement, is an operation (mathematics), operation that takes a Proposition (mathematics), proposition P to another proposition "not P", written \neg P, \mathord P, P^\prime or \over ...
of the
converse of
implication).
Definition
Converse nonimplication is notated
, or
, and is logically equivalent to
and
.
Truth table
The
truth table
A truth table is a mathematical table used in logic—specifically in connection with Boolean algebra, Boolean functions, and propositional calculus—which sets out the functional values of logical expressions on each of their functional arg ...
of
.
Notation
Converse nonimplication is notated
, which is the left arrow from
converse implication
In logic and mathematics, the converse of a categorical or implicational statement is the result of reversing its two constituent statements. For the implication ''P'' → ''Q'', the converse is ''Q'' → ''P''. For the categorical proposition '' ...
(
), negated with a stroke ().
Alternatives include
*
, which combines
converse implication's , negated with a stroke ().
*
, which combines
converse implication's left arrow (
) with
negation's tilde (
).
* M''pq'', in
Bocheński notation
Properties
falsehood-preserving: The interpretation under which all variables are assigned a
truth value
In logic and mathematics, a truth value, sometimes called a logical value, is a value indicating the relation of a proposition to truth, which in classical logic has only two possible values ('' true'' or '' false''). Truth values are used in ...
of 'false' produces a truth value of 'false' as a result of converse nonimplication
Natural language
Grammatical
Example,
If it rains (P) then I get wet (Q), just because I am wet (Q) does not mean it is raining, in reality I went to a pool party with the co-ed staff, in my clothes (~P) and that is why I am facilitating this lecture in this state (Q).
Rhetorical
Q does not imply P.
Colloquial
Not P, but Q.
Boolean algebra
Converse Nonimplication in a general
Boolean algebra
In mathematics and mathematical logic, Boolean algebra is a branch of algebra. It differs from elementary algebra in two ways. First, the values of the variable (mathematics), variables are the truth values ''true'' and ''false'', usually denot ...
is defined as
.
Example of a 2-element Boolean algebra: the 2 elements with 0 as zero and 1 as unity element, operators
as complement operator,
as join operator and
as meet operator, build the Boolean algebra of
propositional logic
The propositional calculus is a branch of logic. It is also called propositional logic, statement logic, sentential calculus, sentential logic, or sometimes zeroth-order logic. Sometimes, it is called ''first-order'' propositional logic to contra ...
.
Example of a 4-element Boolean algebra: the 4 divisors of 6 with 1 as zero and 6 as unity element, operators (co-divisor of 6) as complement operator, (least common multiple) as join operator and (greatest common divisor) as meet operator, build a Boolean algebra.
Properties
Non-associative
if and only if
#s5 (In a
two-element Boolean algebra
In mathematics and abstract algebra, the two-element Boolean algebra is the Boolean algebra whose ''underlying set'' (or universe or ''carrier'') ''B'' is the Boolean domain. The elements of the Boolean domain are 1 and 0 by convention, so that ''B ...
the latter condition is reduced to
or
). Hence in a nontrivial Boolean algebra Converse Nonimplication is nonassociative.
Clearly, it is associative if and only if
.
Non-commutative
*
if and only if
#s6. Hence Converse Nonimplication is noncommutative.
Neutral and absorbing elements
* is a left
neutral element
In mathematics, an identity element or neutral element of a binary operation is an element that leaves unchanged every element when the operation is applied. For example, 0 is an identity element of the addition of real numbers. This concept is use ...
(
) and a right
absorbing element
In mathematics, an absorbing element (or annihilating element) is a special type of element of a set with respect to a binary operation on that set. The result of combining an absorbing element with any element of the set is the absorbing element ...
(
).
*
,
, and
.
* Implication
is the dual of converse nonimplication
#s7.
Computer science
An example for converse nonimplication in computer science can be found when performing a
right outer join on a set of tables from a
database
In computing, a database is an organized collection of data or a type of data store based on the use of a database management system (DBMS), the software that interacts with end users, applications, and the database itself to capture and a ...
, if records not matching the join-condition from the "left" table are being excluded.
References
*
External links
*
{{DEFAULTSORT:Converse Nonimplication
Logical connectives