Editing Logical connective (section)

===Computer science===
{{Main article|Logic gate}}
A truth-functional approach to logical operators is implemented as [[logic gate]]s in [[digital circuit]]s. Practically all digital circuits (the major exception is [[DRAM]]) are built up from [[logical NAND|NAND]], [[logical NOR|NOR]], [[negation|NOT]], and [[logic gate|transmission gate]]s; see more details in [[Truth function#Computer science|Truth function in computer science]]. Logical operators over [[bit array|bit vectors]] (corresponding to finite [[Boolean algebra (structure)|Boolean algebras]]) are [[bitwise operation]]s.

But not every usage of a logical connective in [[computer programming]] has a Boolean semantic. For example, [[lazy evaluation]] is sometimes implemented for {{math|''P'' ∧ ''Q''}} and {{math|''P'' ∨ ''Q''}}, so these connectives are not commutative if either or both of the expressions {{mvar|P}}, {{mvar|Q}} have [[side effect (computer science)|side effect]]s. Also, a [[conditional (programming)|conditional]], which in some sense corresponds to the [[material conditional]] connective, is essentially non-Boolean because for <code>if (P) then Q;</code>, the consequent&nbsp;Q is not executed if the [[antecedent (logic)|antecedent]]&nbsp;P is false (although a compound as a whole is successful ≈ "true" in such case). This is closer to intuitionist and [[constructive mathematics|constructivist]] views on the material conditional— rather than to classical logic's views.