BOOLEAN: Logic & Search Engine

By Staff Reporters

***

***

George Boole, an English mathematician from the 19th century, developed an algebraic method that he first described in his 1847 book, The Mathematical Analysis of Logic and expounded upon in his An Investigation of the Laws of Thought (1854).

Boolean algebra is fundamental to modern computing, and all major programming languages include it. It also figures heavily in statistical methods and set theory.

Today’s database searches are largely based on Boolean logic, which allows us to specify parameters in detail — for example, combining terms to include while excluding others. A Boolean search, in the context of a search engine, is a type of search where you can use special words or symbols to limit, widen, or define your search.

This is possible through Boolean operators such as AND, OR, and NOT, plus symbols like + (add) and (subtract).

When you include an operator in a Boolean search, you’re either introducing flexibility to get a wider range of results, or you’re defining limitations to reduce the number of unrelated results.

COMMENTS APPRECIATED

Subscribe Today!

***