# (+) Boolean Basics – Part #1

The following is a Plus Edition article written by and copyright by Dick Eastman.

NOTE #1: This is part #1 of a 2-part article.

Probably all genealogists have used Google for genealogy searches. For many of us, we go to https://www.google.com, enter the name of an ancestor, click on SEARCH and hope that a reference appears that points to the person we wish to find. Sometimes the name search works well, and sometimes it doesn’t. When it doesn’t work, many genealogists give up and move on to something else. This is especially true with common names when a standard Google search may find hundreds of people with the same name. However, with just a little bit of effort, you may be able to quickly narrow the search to a single person or at least to a manageably small group of people. The trick here is to use some search terms defined 164 years ago.

164-year-old search terms? They didn’t have computers back then! True, but they did have mathematics, and computers are basically mathematical machines. Boolean algebra, as developed in 1854 by George Boole and described in his book An Investigation of the Laws of Thought, is a variant of ordinary elementary algebra differing in its values, operations, and laws. Instead of the usual algebra of numbers, Boolean algebra is the algebra of truth values 0 and 1. In the case of computers, we usually think in terms of the logic statements of true or false. A zero is false and a one is true, as in, “This search result is a TRUE match to the terms entered.” Whether we use one and zero or true and false, all search engines work on Boolean algebra.

By applying a bit of Boolean algebra to our searches, we can be much more specific about the information we seek. We can specify not only the words we seek, but also how those words relate to each other. For genealogists, the results can sometimes be amazing. By specifying Boolean search terms on Google or other search engines, we can sometimes find ancestors or other topics of interest that have eluded us previously.

The remainder of this article is for Plus Edition subscribers only and will remain in the Plus Edition subscribers’ web site for several weeks.

There are three different methods of viewing the full Plus Edition article:

1. If you have a Plus Edition user ID and password, you can read the full article right now at no additional charge in this web site’s Plus Edition at https://eognplus.com/2018/12/10/boolean-basics-part-1/This article will remain online for several weeks.

If you do not remember your Plus Edition user ID or password, you can retrieve them at https://www.eognplus.com and click on “Forgot password?”

2. If you do not have a Plus Edition subscription but would like to subscribe, you will be able to immediately read this article online. What sort of articles can you read in the Plus Edition? Click here to find out. For more information or to subscribe, goto https://blog.eogn.com/subscribe-to-the-plus-edition.

3. Non-subscribers may purchase this one article, without subscribing, for \$2.00 US. You may purchase the article by clicking herePayment can be made with VISA, MasterCard, American Express, Discover Card, or with PayPal’s safe and secure payment system.  You can then either read the article on-screen or else download it to your computer and save it.