What Are Boolean Searches?

What Are Boolean Searches?

In computer science, a Boolean expression is an expression used in programming languages that produces a Boolean value when evaluated. A Boolean value is either true or false.

What is an example of a Boolean search?

Boolean search is a type of search allowing users to combine keywords with operators (or modifiers) such as AND, NOT and OR to further produce more relevant results. For example, a Boolean search could be “hotel” AND “New York”. This would limit the search results to only those documents containing the two keywords.

What does Boolean search mean?

Boolean searching is built on a method of symbolic logic developed by George Boole, a 19th century English mathematician. Boolean searches allow you to combine words and phrases using the words AND, OR, NOT (known as Boolean operators) to limit, broaden, or define your search.

Sophia Al-Mansoor
Author

Sophia Al-Mansoor

Sophia analyzes international trade, startup ecosystems, retail transformation, and supply chain logistics for modern digital publications.