====== Commutativity ====== The //law of commutativity// describes the property of certain mathematical or logical operations that it is possible to permute their arguments – respectively that this is not allowed for any other operation. For instance, [[wp>Addition|addition]] is commutative, therefore we can conclude: > ''a + b'' = ''b + a'' Conversely, [[wp>Subtraction|subtraction]] is //not// commutative((To be precise, the subtraction operation is //anticommutative//, since it holds that: ''a - b'' = ''-(b - a)'')), therefore the following is not valid: > ''a - b'' = ''b - a'' ===== Other names ===== * Commutative property (of operations) ===== Description ===== ==== Mathematics ==== Most readers are probably familiar with the principle of //commutativity// from mathematics. In particular, the principle that the following two operations //are// commutative: >
Addition:
''a + b'' ''b + a''
Multiplication:
''ab'' ''ba''
Whereas e.g. the following mathematical operations are //not// commutative((In this context, the red slashed equality sign (''='') indicates that this operation is not valid. This is //not// the same as mathematical inequality (represented by ''≠''), which would indicate that the two operations have different results under all circumstances. However, even an invalid operation can have a valid result, for example ''2⁴ = 4²''. \\ This is similar to the symbol "''''" ("not [[glossary:logical_equivalence|logically equivalent]] to") from logic (see next section). To make it clear that it still is a mathematical and not a logical operation, the (somewhat unusual) typography was chosen here instead of the logical symbol.)): >
Subtraction:
''a - b'' ''b - a''
Division:
''a ÷ b'' ''b ÷ a''
Modulo:
''a mod b'' ''b mod a''
Exponentiation:
''a'' ''bᵃ''
==== Logic ==== Just as in mathematics, there are also commutative operations in logic, such as the following: >
[[glossary:adjunction|Adjunction]]:
''AB'' ≡ ''BA'' \\ („A, or B, or both“ //is logically equivalent to// „B, or A, or both“)
[[glossary:contravalence|Contravalence]]:
''AB'' ≡ ''BA'' \\ (“either A, or B, but not both” //is logically equivalent to// “either B, or A, but not both”)
[[glossary:conjunction|Conjunction]]:
''AB'' ≡ ''BA'' \\ (“A and B” //is logically equivalent to// “B and A”)
[[glossary:biconditional|Biconditional]]:
''AB'' ≡ ''BA'' \\ (“A exactly when B” is logically equivalent to “B exactly when A”)
But other logical operations are expressly //__not__ commutative//; of particular interest to us is the following: >
[[glossary:conditional|Conditional]]:
''AB'' ≢ ''BA'' \\ (“when A, then B” //is __not__ logically equivalent to// “when B, then A”)
Another perspective on the distinction between [[glossary:conditional|conditional]] and [[glossary:biconditional|biconditional]] is that the latter has two //equivalent// arguments, and that therefore the commutation of these arguments is possible. Thus, the //biconditional// is a special case of the //conditional//, which is applicable when ''A ≡ B''. If a //conditional// is reversed illicitly, the fallacy of [[logic:formal_fallacies:affirming_the_consequent|affirming of the consequence]] is committed. See also: [[paralogisms:illicit_inversion|Illicit inversion]]. ===== See also ===== * [[logic:formal_fallacies:affirming_the_consequent|Affirming the consequence]] * [[paralogisms:illicit_inversion|Illicit inversion]] ===== More information ===== * [[wp>Commutative property|Commutative property]] on //Wikipedia// {{page>templates:banner#Short-BG-Logic&noheader&nofooter}}