A rule of inference in propositional logic. Written 'com.' for short. It goes like this:

(P∨Q) = (Q∨P)
And
(Q∧P) = (P∧Q)

"I have an apple or an orange" is the same as "I have an orange or an apple".
And...
"I have an apple and an orange" is the same as "I have an orange and an apple".

A very simple and intuitive rule, but logicians like to be very precise.


Back up to Rules of Inference
Review your Logic symbols

A property that some binary operations possess. The operation @ is commutative if for all a,b, the following holds:


a@b = b@a

This is vastly different than associativity.

Examples:


Non examples:

Log in or registerto write something here or to contact authors.