<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
	<id>http://debianws.lexgopc.com/wiki143/index.php?action=history&amp;feed=atom&amp;title=Boolean_expression</id>
	<title>Boolean expression - Revision history</title>
	<link rel="self" type="application/atom+xml" href="http://debianws.lexgopc.com/wiki143/index.php?action=history&amp;feed=atom&amp;title=Boolean_expression"/>
	<link rel="alternate" type="text/html" href="http://debianws.lexgopc.com/wiki143/index.php?title=Boolean_expression&amp;action=history"/>
	<updated>2026-05-05T18:35:13Z</updated>
	<subtitle>Revision history for this page on the wiki</subtitle>
	<generator>MediaWiki 1.43.1</generator>
	<entry>
		<id>http://debianws.lexgopc.com/wiki143/index.php?title=Boolean_expression&amp;diff=2162250&amp;oldid=prev</id>
		<title>109.166.138.251: associated to, not special case</title>
		<link rel="alternate" type="text/html" href="http://debianws.lexgopc.com/wiki143/index.php?title=Boolean_expression&amp;diff=2162250&amp;oldid=prev"/>
		<updated>2025-03-13T13:52:07Z</updated>

		<summary type="html">&lt;p&gt;associated to, not special case&lt;/p&gt;
&lt;p&gt;&lt;b&gt;New page&lt;/b&gt;&lt;/p&gt;&lt;div&gt;{{Short description|Expression in a computer program}}&lt;br /&gt;
In [[computer science]], a &amp;#039;&amp;#039;&amp;#039;Boolean expression&amp;#039;&amp;#039;&amp;#039; (also known as &amp;#039;&amp;#039;&amp;#039;logical expression&amp;#039;&amp;#039;&amp;#039;)  is an [[Expression (programming)|expression]] used in [[programming language]]s that produces a [[Boolean value]] when evaluated. A Boolean value is either &amp;#039;&amp;#039;&amp;#039;true&amp;#039;&amp;#039;&amp;#039; or &amp;#039;&amp;#039;&amp;#039;false&amp;#039;&amp;#039;&amp;#039;. A Boolean expression may be composed of a combination of the Boolean constants &amp;#039;&amp;#039;&amp;#039;True/False&amp;#039;&amp;#039;&amp;#039; or &amp;#039;&amp;#039;&amp;#039;Yes/No&amp;#039;&amp;#039;&amp;#039;, [[Boolean data type|Boolean-typed]] variables, Boolean-valued operators, and [[Boolean-valued function]]s.&amp;lt;ref&amp;gt;{{citation&lt;br /&gt;
 | last1 = Gries | first1 = David | author1-link = David Gries&lt;br /&gt;
 | last2 = Schneider | first2 = Fred B. | author2-link = Fred B. Schneider&lt;br /&gt;
 | contribution = Chapter 2. Boolean Expressions&lt;br /&gt;
 | isbn = 9780387941158&lt;br /&gt;
 | page = 25ff&lt;br /&gt;
 | publisher = Springer&lt;br /&gt;
 | series = Monographs in Computer Science&lt;br /&gt;
 | title = A Logical Approach to Discrete Math&lt;br /&gt;
 | url = https://books.google.com/books?id=ZWTDQ6H6gsUC&amp;amp;pg=PA25&lt;br /&gt;
 | year = 1993}}.&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Boolean expressions correspond to [[propositional formula]]s in logic and are associated to [[Boolean circuit]]s.&amp;lt;ref&amp;gt;{{citation&lt;br /&gt;
 | last = van Melkebeek | first = Dieter&lt;br /&gt;
 | isbn = 9783540414926&lt;br /&gt;
 | page = 22&lt;br /&gt;
 | publisher = Springer&lt;br /&gt;
 | series = [[Lecture Notes in Computer Science]]&lt;br /&gt;
 | title = Randomness and Completeness in Computational Complexity&lt;br /&gt;
 | url = https://books.google.com/books?id=-S0zCjOAIVwC&amp;amp;pg=PA22&lt;br /&gt;
 | volume = 1950&lt;br /&gt;
 | year = 2000}}.&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
==Boolean operators==&lt;br /&gt;
Most [[programming language]]s have the Boolean operators [[Logical disjunction|OR]], [[Logical conjunction|AND]] and [[Negation|NOT]]; in [[C (programming language)|C]] and some [[List of C-family programming languages|languages inspired by it]], these are represented by &amp;quot;||&amp;quot; (double pipe character), &amp;quot;&amp;amp;&amp;amp;&amp;quot; (double [[ampersand]]) and &amp;quot;!&amp;quot; ([[Exclamation mark|exclamation point]]) respectively, while the corresponding [[bitwise operation]]s are represented by &amp;quot;|&amp;quot;, &amp;quot;&amp;amp;&amp;quot; and &amp;quot;~&amp;quot; (tilde).&amp;lt;ref&amp;gt;E.g. for [[Java (programming language)|Java]] see {{citation&lt;br /&gt;
 | last1 = Brogden | first1 = William B.&lt;br /&gt;
 | last2 = Green | first2 = Marcus&lt;br /&gt;
 | isbn = 9780789728616&lt;br /&gt;
 | page = 45&lt;br /&gt;
 | publisher = Que Publishing&lt;br /&gt;
 | title = Java 2 Programmer&lt;br /&gt;
 | url = https://books.google.com/books?id=24nPZw9Wsf4C&amp;amp;pg=PA45&lt;br /&gt;
 | year = 2003}}.&amp;lt;/ref&amp;gt;  In the mathematical literature the symbols used are often &amp;quot;+&amp;quot; ([[Plus sign|plus]]), &amp;quot;&amp;#039;&amp;#039;&amp;#039;·&amp;#039;&amp;#039;&amp;#039;&amp;quot; ([[Full stop|dot]]) and [[overbar]], or &amp;quot;∨&amp;quot; ([[Descending_wedge|vel]]), &amp;quot;∧&amp;quot; ([[Wedge_(symbol)|et]]) and &amp;quot;¬&amp;quot; ([[Negation|not]]) or &amp;quot;′&amp;quot; (prime).&lt;br /&gt;
&lt;br /&gt;
Some languages, e.g., [[Perl]] and [[Ruby (programming language)|Ruby]], have two sets of Boolean operators, with identical functions but different precedence. Typically these languages use &amp;#039;&amp;#039;&amp;#039;and&amp;#039;&amp;#039;&amp;#039;, &amp;#039;&amp;#039;&amp;#039;or&amp;#039;&amp;#039;&amp;#039; and &amp;#039;&amp;#039;&amp;#039;not&amp;#039;&amp;#039;&amp;#039; for the lower precedence operators.&lt;br /&gt;
&lt;br /&gt;
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 &amp;quot;|&amp;quot;, &amp;quot;&amp;amp;&amp;quot;, &amp;quot;¬&amp;quot; (infix) and &amp;quot;¬&amp;quot; (prefix).&lt;br /&gt;
&lt;br /&gt;
===Short-circuit operators===&lt;br /&gt;
{{Main|Short-circuit evaluation}}&lt;br /&gt;
Some programming languages, e.g., [[Ada (programming language)|Ada]], have [[Short-circuit evaluation|short-circuit]] Boolean operators. These operators use a [[lazy evaluation]], that is, if the value of the expression can be determined from the left hand Boolean expression then they do not evaluate the right hand Boolean expression. As a result, there may be [[Side effect (computer science)|side effects]] that only occur for one value of the left hand operand.&lt;br /&gt;
&lt;br /&gt;
==Examples==&lt;br /&gt;
&lt;br /&gt;
*The expression {{code|5 &amp;gt; 3}} is evaluated as {{samp|true}}.&lt;br /&gt;
*The expression {{code|3 &amp;gt; 5}} is evaluated as {{samp|false}}. &lt;br /&gt;
*{{code|1=5&amp;gt;=3}} and {{code|1=3&amp;lt;=5}} are equivalent Boolean expressions, both of which are evaluated as {{samp|true}}.&lt;br /&gt;
*Of course, most Boolean expressions will contain at least one variable ({{code|X &amp;gt; 3}}), and often more ({{code|X &amp;gt; Y}}).&lt;br /&gt;
&lt;br /&gt;
==See also==&lt;br /&gt;
*[[Expression (computer science)]]&lt;br /&gt;
*[[Expression (mathematics)]]&lt;br /&gt;
*[[Boolean function]]&lt;br /&gt;
&lt;br /&gt;
==References==&lt;br /&gt;
{{reflist}}&lt;br /&gt;
 	&lt;br /&gt;
==External links==&lt;br /&gt;
*[http://www.maths.tcd.ie/pub/HistMath/People/Boole/CalcLogic/CalcLogic.html The Calculus of Logic], by George Boole, Cambridge and Dublin Mathematical Journal Vol. III (1848), pp.&amp;amp;nbsp;183–98.&lt;br /&gt;
&lt;br /&gt;
{{DEFAULTSORT:Boolean Expression}}&lt;br /&gt;
[[Category:Boolean algebra]]&lt;br /&gt;
[[Category:Operators (programming)]]&lt;/div&gt;</summary>
		<author><name>109.166.138.251</name></author>
	</entry>
</feed>