Boolean expression: Difference between revisions

Content deleted Content added
m Adding short description: "Expression in a computer program that produces either "true" or "false" when evaluated" (Shortdesc helper)
Line 33:
| url = https://books.google.com/books?id=24nPZw9Wsf4C&pg=PA45
| year = 2003}}.</ref> In the mathematical literature the symbols used are often "+" ([[Plus sign|plus]]), "'''·'''" ([[Full stop|dot]]) and [[overbar]], or "∨" ([[Descending_wedge|vel]]), "∧" ([[Wedge_(symbol)|et]]) and "¬" ([[Negation|not]]) or "′" (prime).
 
Some languagess, e.g., [[Perl]], have two sets of boolean operators, with identical functions but different precedence. Typically these languages use '''and''', '''or''' and '''not''' for the lower precedence operators.
 
Some programming languages derived from [[PL/I]] have a bit string type and use BIT(1) rather than a separate boolean type. In those languages the same operators serve for boolean operations and bitwise operations. The languages represent OR, AND, NOT and EXCLUSIVE OR by "|", "&", "¬" (infix) and "¬" (prefix).
 
==Examples==