PDF version
of this book

**Next:** Formal mathematics **Up:** Mathematical
structure **Previous:** Logically determined unsolvable
problems **Contents**

Formal logic

Mathematics starts with formal logic. This is a set of rules for making deductions that seem self evident. Syllogisms like the following occur in every day conversation.

All humans are mortal.Mathematical logic formalizes such deductions with rules precise enough to program a computer to decide if an argument is valid.

Socrates is a human.

Therefore Socrates is mortal.

This is facilitated by representing objects and relationships symbolically. For example Use for the set of humans, for the set of mortal creatures and for Socrates. Use the symbolic expression `' to indicate that object is a member of set . Thus `Socrates is a human' is represented by . Use the symbol in an expression ` ' to indicate that if statement is true than statement must be true. Use the `quantifier' to indicate that all objects satisfy some condition. For example all men are mortal can be written as . is called a universal quantifier.

The syllogism can be formalized as follows.

therefore

Logic assumes something cannot be both true and not true. It looks only at the truth value of a proposition. It involves simple relationships between these truth values. These can be represented by truth tables as shown in Table 5.1. The only logical operations required are the three in this figure. Others such as implication represented by `' can be constructed from these three. is the same as . implies requires that either both and are true or is false.

Determining the truth of a logical expression that contains no quantifiers (like ) is a straightforward application of simple rules. One can use a truth table to evaluate each subexpression starting with those at the root of the expression tree as shown in Table 5.2. If a logical expression contains quantifiers, the logical relationship involved must be evaluated over a range of values to determine the truth of the expression. If the range is infinite, there is no general way to evaluate the expression. Induction on the integers can solve some problems of this type.

To use induction to prove a property is true for all integers requires two steps. First prove the property holds for 0. Then prove that if the property is true for any number it is also true for . Having established these two results the principle of induction allows one to conclude the property is true for all integers. Figure 5.1 gives an example of such a proof. The principle of induction is an axiom of mathematics that seems self evident, but cannot be derived from more basic principles. It must be assumed.

PDF version
of this book

**Next:** Formal mathematics **Up:** Mathematical
structure **Previous:** Logically determined unsolvable
problems **Contents**

home | consulting | videos | book | QM FAQ | contact |