Computer Science
Truth-functional approach to logical operators is implemented as logic gates in digital circuits. Practically all digital circuits (the major exception is DRAM) are built up from NAND, NOR, NOT, and transmission gates; see more details in Truth function#Computer science. Logical operators over bit vectors (corresponding to finite Boolean algebras) are bitwise operations.
But not any usage of a logical connective in programming has a Boolean semantic. For example, lazy evaluation is sometimes implemented for P ∧ Q and P ∨ Q, so these connectives are not commutative if some of expressions P, Q has side effects. Also, a conditional, which in some sense corresponds to the material conditional connective, is essentially non-Boolean because for if (P) then Q; the consequent Q is not executed if the antecedent P is false (although a compound as a whole is successful ≈ "true" in such case). This is closer to intuitionist and constructivist views on the material conditional, rather than to classical logic's ones.
Read more about this topic: Logical Connective
Famous quotes containing the words computer and/or science:
“The archetype of all humans, their ideal image, is the computer, once it has liberated itself from its creator, man. The computer is the essence of the human being. In the computer, man reaches his completion.”
—Friedrich Dürrenmatt (1921–1990)
“After sitting in my chamber many days, reading the poets, I have been out early on a foggy morning and heard the cry of an owl in a neighboring wood as from a nature behind the common, unexplored by science or by literature.”
—Henry David Thoreau (1817–1862)