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 Connectives
Famous quotes containing the words computer and/or science:
“Family life is not a computer program that runs on its own; it needs continual input from everyone.”
—Neil Kurshan (20th century)
“Science is the only truth and it is the great lie. It knows nothing, and people think it knows everything. It is misrepresented. People think that science is electricity, automobilism, and dirigible balloons. It is something very different. It is life devouring itself. It is the sensibility transformed into intelligence. It is the need to know stifling the need to live. It is the genius of knowledge vivisecting the vital genius.”
—Rémy De Gourmont (1858–1915)