Editing Logical connective (section)

==Properties==
Some logical connectives possess properties that may be expressed in the theorems containing the connective. Some of those properties that a logical connective may have are:

; [[Associativity]]: Within an expression containing two or more of the same associative connectives in a row, the order of the operations does not matter as long as the sequence of the operands is not changed.
; [[Commutativity]]:The operands of the connective may be swapped, preserving logical equivalence to the original expression.
; [[Distributivity]]: A connective denoted by · distributes over another connective denoted by +, if {{math|1=''a'' · (''b'' + ''c'') = (''a'' · ''b'') + (''a'' · ''c'')}} for all operands {{mvar|a}}, {{mvar|b}}, {{mvar|c}}.
; [[Idempotence]]: Whenever the operands of the operation are the same, the compound is logically equivalent to the operand.
; [[Absorption Law|Absorption]]: A pair of connectives &and;, &or; satisfies the absorption law if <math>a\land(a\lor b)=a</math> for all operands {{mvar|a}}, {{mvar|b}}.
; [[Monotonicity]]: If ''f''(''a''<sub>1</sub>, ..., ''a''<sub>''n''</sub>) ≤ ''f''(''b''<sub>1</sub>, ..., ''b''<sub>''n''</sub>) for all ''a''<sub>1</sub>, ..., ''a''<sub>''n''</sub>, ''b''<sub>1</sub>, ..., ''b''<sub>''n''</sub> ∈ {0,1} such that ''a''<sub>1</sub> ≤ ''b''<sub>1</sub>, ''a''<sub>2</sub> ≤ ''b''<sub>2</sub>, ..., ''a''<sub>''n''</sub> ≤ ''b''<sub>''n''</sub>. E.g., &or;, &and;, ⊤, ⊥.
; [[Affine transformation|Affinity]]: Each variable always makes a difference in the truth-value of the operation or it never makes a difference.<!-- has this an appropriate generalization to non-classical logics? --> E.g., &not;, ↔,  <math>\nleftrightarrow</math>, ⊤, ⊥.
; [[Duality (mathematics)|Duality]]: To read the truth-value assignments for the operation from top to bottom on its [[truth table]] is the same as taking the complement of reading the table of the same or another connective from bottom to top. Without resorting to truth tables it may be formulated as {{math|1=''g&#771;''(¬''a''<sub>1</sub>, ..., ¬''a''<sub>''n''</sub>) = ¬''g''(''a''<sub>1</sub>, ..., ''a''<sub>''n''</sub>)}}. E.g., &not;.
; Truth-preserving: The compound all those arguments are tautologies is a tautology itself. E.g., &or;, &and;, ⊤, →, ↔, ⊂ (see [[Validity (logic)|validity]]).
; Falsehood-preserving: The compound all those argument are [[contradiction]]s is a contradiction itself. E.g., &or;, &and;, <math>\nleftrightarrow</math>, ⊥, ⊄, ⊅ (see [[Validity (logic)|validity]]).
; [[Involution (mathematics)|Involutivity]] (for unary connectives): {{math|1=''f''(''f''(''a'')) = ''a''}}. E.g. negation in classical logic.

For classical and intuitionistic logic, the "="<!-- BTW why not "⇔"? --> symbol means that corresponding implications "...→..." and "...←..." for logical compounds can be both proved as theorems, and the "≤"<!-- BTW why not "⇒"/"→"? --> symbol means that "...→..." for logical compounds is a consequence of corresponding "...→..." connectives for propositional variables. Some [[many-valued logic]]s may have incompatible definitions of equivalence and order (entailment).

Both conjunction and disjunction are associative, commutative and idempotent in classical logic, most varieties of many-valued logic and intuitionistic logic. The same is true about distributivity of conjunction over disjunction and disjunction over conjunction, as well as for the absorption law.

In classical logic and some varieties of many-valued logic, conjunction and disjunction are dual, and negation is self-dual, the latter is also self-dual in intuitionistic logic. <!-- I am not sure about ∧ and ∨. Aforementioned definition of duality does not imply that one connective is equivalent to a form with two-layer negation, so such intuitionistic duality is plausible. But one should carefully verify such additions, at least because intuitionistic negation is not an involution and hence the duality relation is not symmetric. -->

{{expand section|date=March 2012}}