# Introduction to Truth Tables, Statements, and Logical Connectives

A **truth table** is one of those things in mathematics that is much easier to understand when you see how it looks and how it works, than learning through its definition. Anyway, we will attempt to define it in order to have a baseline or basic understanding of what it is.

## Definition of a Truth Table

In math logic, a **truth table** is a chart of rows and columns showing the truth value (either “T” for True or “F” for False) of every possible combination of the given statements (usually represented by uppercase letters P, Q, and R) as operated by logical connectives.

## Two Components of a Truth Table

**I. Statement**

**Definition:** A **statement** is a sentence or mathematical expression that is either definitely true or definitely false but not both. It is usually denoted by an uppercase letter or variable. The common ones are P, Q, R and S.

**II. Logical Connective**

**Definition:** A **logical connective** is a word usually written as a symbol that carries a particular instruction of logic on how to operate a statement or compound statement. Logical connectives can also be used to join or combine two or more statements to form a new statement.

## Examples of Statements

- Statements that are definitely true.

- Statements that are definitely false.

**OPEN SENTENCE**

An open sentence is a sentence that is either true or false depending on the value of the variable(s). This kind of sentence is NOT a statement because it must be definitely true or definitely false.

Examples:

- The number \color{red}k is even.

Notice, the sentence is true if k=4 or false if k=7. Since the truth of the sentence can be true or false depending on the value of the variable k, then it is an open sentence, and thus not a statement.

- The number \color{blue}x^2 is always positive.

This sentence may look like a statement because it seems that it is definitely true. However, upon closer scrutiny, the sentence is true if x>0 or x<0. But there is one loophole, that is, if x=0, the sentence becomes false because 0^2=0. Remember, 0 is neither positive nor negative. Thus, this sentence is NOT a statement but a simple case of an open sentence.

## Common Logical Connectives

For this part of the lesson, my goal is to briefly introduce you to the five common logical connectives which are also known as logical operators. You will also know the symbol used for each operator, and what it stands for.

**Note: **\large{P} and \large{Q} are statements.

1) Negation

- Symbol: ~ or \neg is read as
**NOT** - Example: ~P or \neg P is translated as “not P” or “it is not true that P“

2) Conjunction

- Symbol: \wedge is read as
**AND** - Example: P \wedge Q is translated as “P
*and*Q“

3) Disjunction or Inclusive OR

- Symbol: \vee is read as
**OR** - Example: P \vee Q is translated as “P
*or*Q“

4) Implication or Conditional

- Symbol: \Rightarrow is read as
**IMPLIES** - Example: P \Rightarrow Q stands for the statement “P
*implies*Q“

5) Double Implication or Biconditional

- Symbol: \Leftrightarrow is read as
**IF AND ONLY IF** - Example: P \Leftrightarrow Q stands for the statement “P if and only if Q“

## Truth Tables for Negation, Conjunction, and Disjunction

I intend to cover only the three basic logical operators, namely: negation, conjunction, and disjunction. This part of the lesson will give you a preview how a truth table may look.

I have a separate lesson discussing in-depth how to construct the truth tables of the logical connectives mentioned here and the rest of them.

For now, let’s focus our attention on the truth tables below:

**1. Truth Table of Negation**

**Rule for Negation Logical Operator**

The truth value of a negated statement is the exact opposite that of the original statement.

**2. Truth Table of Conjunction**

**Rule for Conjunction or “AND” Logical Operator**

The compound statement P **and** Q, written as P \wedge Q, is TRUE if the statements P and Q are both true. Otherwise, the statement P \wedge Q is FALSE.

**3. Truth Table of Disjunction**

**Rule for Disjunction or “OR” Logical Operator**

The compound statement P **or** Q, written as P \vee Q, is TRUE if just one of the statements P and Q is true. In addition, since this is an “Inclusive OR”, the statement P \vee Q is also TRUE if both P and Q are true. Therefore, it is only FALSE if both P and Q are false.