In propositional logic, the commutativity of conjunction is a valid argument form and truth-functional tautology. It is considered to be a law of classical logic. It is the principle that the conjuncts of a logical conjunction may switch places with each other, while preserving the truth-value of the resulting proposition.[1]
Commutativity of conjunction can be expressed in sequent notation as:
(P\landQ)\vdash(Q\landP)
and
(Q\landP)\vdash(P\landQ)
where
\vdash
(Q\landP)
(P\landQ)
(P\landQ)
(Q\landP)
or in rule form:
P\landQ | |
\thereforeQ\landP |
and
Q\landP | |
\thereforeP\landQ |
where the rule is that wherever an instance of "
(P\landQ)
(Q\landP)
(Q\landP)
(P\landQ)
or as the statement of a truth-functional tautology or theorem of propositional logic:
(P\landQ)\to(Q\landP)
and
(Q\landP)\to(P\landQ)
where
P
Q
For any propositions H1, H2, ... Hn, and permutation σ(n) of the numbers 1 through n, it is the case that:
H1
\land
\land
\land
is equivalent to
Hσ(1)
\land
\land
For example, if H1 is
It is raining
H2 is
Socrates is mortal
and H3 is
2+2=4
then
It is raining and Socrates is mortal and 2+2=4
is equivalent to
Socrates is mortal and 2+2=4 and it is raining
and the other orderings of the predicates.