If you do much online complex searching you have heard about Boolean searches named for George Boole who died December 9, 1964. He was an English mathematician and logician who helped establish modern symbolic logic and an algebra of logic, now called Boolean algebra. By replacing logical operations by symbols, Boole showed that the operations could be manipulated to give logically consistent results. Booles logical algebra is essentially an algebra of classes, being based on such concepts as complement and union of classes. The operation of almost all modern digital computers is based on two-valued or binary systems. Binary systems were known in the ancient Chinese civilisation and by the classical Greek philosophers who created a well structured binary system, called propositional logic. Propositions may be TRUE or FALSE, and are stated as functions of other propositions which are connected by the three basic logical connectives: AND, OR, and NOT. For example the statement: “I will take an umbrella with me if it is raining or the weather forecast is bad” connects the proposition I will take an umbrella with me functionally to the two propositions it is raining and the weather forecast is bad. We can see that the umbrella proposition can be fully determined by the raining and weather ones. In functional terms we can be consider the truth value of the umbrella proposition as the output of the truth values of the other two. We can represent this by means of a simple block diagram (Figure 1). Boolean Logic is a basis of computer programming.
Posted on: Mon, 08 Dec 2014 13:33:06 +0000