The IT Law Wiki
The IT Law Wiki

Definition[]

A Boolean search (named for the British-born Irish mathematician George Boole) is a search methodology based on Boolean mathematics.

In Boolean searches, an ‘and’ operator between two words or other values (for example, ‘pear AND apple’) means one is searching for documents containing both of the words or values, not just one of them. An ‘or’ operator between two words or other values (for example, ‘pear OR apple’) means one is searching for documents containing either of the words.[1]

References[]

See also[]