One of the best ways to avoid those long lists of links when entering a list of keywords is to use Boolean logic operators. Each search engine will have their own way to enter logical operators. Be sure to look at the rules page at each site to learn how to use these words.
Boolean logical operators will either include or exclude items from a search. The following words are Boolean operators. Take a look at the example and the Venn diagrams that show what kind of results you can expect.
AND - Items found must have all the words linked by the word "and" in the search.
OR - Items found can have a single word or both words linked by the word "or" in the search.
NOT - Items found cannot have the word linked by the word "not" in the search.
You can use more than one Boolean operator for more complex searches.
Remember that Boolean searches are very specific. The word "kitten" and "kittens" are considered separate. If you want to eliminate both from your search, you need to include both words separated by the word "not."
Some advanced search engines, like Google, have an advanced search page that builds these search terms in for you. On these pages, they may ask you to list words you don't want to see (NOT) in one area and all the words you would like to see (AND) in others.
CJ Kazilek. (2009, December 17). Boolean Search Terms. ASU - Ask A Biologist. Retrieved January 11, 2025 from https://askabiologist.asu.edu/boolean-search-terms
CJ Kazilek. "Boolean Search Terms". ASU - Ask A Biologist. 17 December, 2009. https://askabiologist.asu.edu/boolean-search-terms
CJ Kazilek. "Boolean Search Terms". ASU - Ask A Biologist. 17 Dec 2009. ASU - Ask A Biologist, Web. 11 Jan 2025. https://askabiologist.asu.edu/boolean-search-terms
By volunteering, or simply sending us feedback on the site. Scientists, teachers, writers, illustrators, and translators are all important to the program. If you are interested in helping with the website we have a Volunteers page to get the process started.