One tool to reduce logical expressions is the mathematics of logical expressions, introduced by George Boole in 1854 and known today as Boolean Algebra. The rules of Boolean Algebra are simple and straight-forward, and can be applied to any logical expression. The resulting reduced expression can then be readily tested with a Truth Table, to verify that the reduction was valid.

This has a very great role to play in abstract algebra. In fact, in abstract algebra, Boolean algebra is an algebraic that captures essential properties of both set operation and logic operations. Specifically, it deals with the set operations of intersection, union, complement and the logic operations of AND, or, NOT.

Like any lattice, a Boolean algebra (A, land, lor) gives rise to a partially ordered set (A, ≤) by defining

a ≤ b precisely when a = a land b

(which is also equivalent to b = a lor b).

In fact one can also define a Boolean algebra to be a distributive lattice with least element 0 and greatest element 1, within which every element x has a complement x such that

x land x = 0 and x lor x = 1

Here land and lor are used to denote the infimum (meet) and supremum (join) of two elements. Again, if complements in the above sense exist, then they are uniquely determined.

The algebraic and the order theoretic perspective can usually be used interchangeably and both are of great use to import results and concepts from both universal algebra and order theory. In many practical examples an ordering relation, conjunction, disjunction, and negation are all naturally available, so that it is straightforward to exploit this relationship. One can also apply general insights from duality in order theory to Boolean algebras. Especially, the order dual of every Boolean algebra, or, equivalently, the algebra obtained by exchanging land and lor, is also a Boolean algebra. In general, any law valid for Boolean algebras can be transformed into another valid, dual law by exchanging 0 with 1, land with lor, and ≤ with ≥.

The operators of Boolean algebra may be represented in various ways. Often they are simply written as AND, OR and NOT. In describing circuits, NAND (Not AND), NOR (Not OR) and XOR may also be used. Mathematicians, engineers, and programmers often use + for OR and · for AND (since in some ways those operations are analogous to addition and multiplication in other algebraic structures and this notation makes it very easy to get sum of products form for people who are familiar with normal algebra) and represent NOT by a line drawn above the expression being negated. Sometimes, the symbol ~ or ! is used for NOT.

Every Boolean algebra (A, land, lor) gives rise to a ring (A, +, *) by defining a + b = (a land b) lor (b land a) (this operation is called symmetric difference in the case of sets and XOR in the case of logic) and a * b = a land b. The zero element of this ring coincides with the 0 of the Boolean algebra; the multiplicative identity element of the ring is the 1 of the Boolean algebra. This ring has the property that a * a = a, for all a in A; rings with this property are called Boolean rings.

Conversely, if a Boolean ring A is given, we can turn it into a Boolean algebra by defining x lor y = x + y + xy and x land y = xy. Since these two operations are inverses of each other, we can say that every Boolean ring arises from a Boolean algebra, and vice versa. Furthermore, a map f: A → B is a homomorphism of Boolean algebras if and only if it is a homomorphism of Boolean rings. The categories of Boolean rings and Boolean algebras are equivalent.

An ideal of the Boolean algebra A is a subset I such that for all x, y in I we have x lor y in I and for all a in A we have a land x in I. This notion of ideal coincides with the notion of ring ideal in the Boolean ring A. An ideal I of A is called prime if I ≠ A and if a land b in I always implies a in I or b in I. An ideal I of A is called maximal if I ≠ A and if the only ideal properly containing I is A itself. These notions coincide with ring theoretic ones of prime ideal and maximal ideal in the Boolean ring A.

The dual of an ideal is a filter. A filter of the Boolean algebra A is a subset p such that for all x, y in p we have x land y in p and for all a in A if a lor x = a then a in p.

__________
About the Author:
Author Devendra Saxena is associated with Algebra Articles and take care of College Algebra Articles.

Similar Articles

• No Related Post

The information which is available on the internet today probably exceeds that of any other time in history. Research is possible and for those who enjoy sports or for whom sports betting are a recreational activity, they certainly use statistics in arriving at decisions as to which team to back or which horse to bet on.

For others, it’s important to understand where to find help with statistics in order to make good decisions based on the information which is collected and categorized. Statistics help can be obtained from many different places and in many forms. Probably the most important decision to be made in pursuing decision based on statistics is where to find the raw data. Advanced sampling techniques assist in many studies, but it’s important to understand that a poor sample means results are not dependable.

For the student who is attempting to understand the subject, they can find help in textbooks, on line classes or through a tutor. The level of instruction ranges from very simple explanations to assistance in preparing for advanced examinations which require statistics understanding. For anyone in business, a basic statistics class is a great idea. It will give you an understanding of how to go about gathering information, categorizing it and how to use it to answer common business questions. If you need statistics help just to have an understanding of how various types of statistical gathering works, classroom or textbook learning is probably the best way to approach the subject. Of course, you will have a significant amount of time and learning involved in understanding the basics.

Another way to get statistics help is to hire a consultant to do the work that you need to have done. This solution is inconvenient at best, and sometimes expensive, plus it may mean almost as much work determining that exact information which is needed as it will to go ahead and complete the project for which you need the information. If you must determine where to find the qualified consultant and gather the information needed to coordinate the project, you may still need to spend time in ensuring that the consultant understands the nature of the question you need answered.

Another alternative for obtaining statistics help is through the software programs and spreadsheet programs now available for computers. Most of the spreadsheet programs have statistical functions built in for such things as standard deviation, averages, median of a range and some of the other more common formulas. Most of these formulas also have a help feature which will explain the functions in enough detail so that you can determine how to accomplish the capturing of the information which you require.

__________
About the Author:
Robert Duvall collaborates with Sempax Statistical Consulting.

Similar Articles

• No Related Post