Propositional Calculus

 

To discuss reasoning, we need to agree on some rules and notation about the truth of sentences. A sentence that is either true or false is called a proposition. For example, each of the following lines contains a proposition:

Winter begins in June in the Southern Hemisphere.

2 + 2 = 4.

If it is raining, then there are clouds in the sky.

I may or may not go to a movie tonight.

All integers are even.

For this discussion we'll denote propositions by the letters P, Q, and R, possibly subscripted. Propositions can be combined to form more complicated propositions, just the way we combine sentences, using the words "not," "and," "or," and the phrase "if... then..." These combining operations are often called connectives. We'll denote them by the following symbols and words:

Ø  not, negation.

Ù  and, conjunction.

Ú  or, disjunction.

® conditional, implication.

Some common ways to read the expression P ® Q are "if P then Q," "Q if P" "P implies Q" "P is a sufficient condition for Q" and "Q is a necessary condition for P". P is called the antecedent, premise, or hypothesis, and Q is called the consequent or conclusion of P ® Q.

Now that we have some symbols, we can denote propositions in symbolic form. For example, if P denotes the proposition "It is raining" and Q denotes the proposition "There are clouds in the sky," then P ® Q denotes the proposition "If it is raining, then there are clouds in the sky." Similarly, Ø P denotes the proposition "It is not raining".

The four logical operators are defined to reflect their usage in everyday English.
Table 1, a truth table, defines the operators for all possible truth values of their operands.

Table 1

P

Q

Ø P

P Ú Q

P Ù Q

P ® Q

false

false

true

false

false

true

false

true

true

true

false

true

true

false

false

true

false

true

true

true

false

true

true

false