Propositions and Truth Values Notes

Propositions and Truth Values

Definitions

  • A proposition makes a claim (either an assertion or a denial) that may be either true or false. It must have the structure of a complete sentence.

  • Any proposition has two possible truth values:

    • T = true

    • F = false

  • A truth table is a table with a row for each possible set of truth values for the propositions being considered.

Negation (Opposites)

  • The negation of a proposition pp is another proposition that makes the opposite claim of pp.

    • If pp is true (T), not pp is false (F).

    • If pp is false (F), not pp is true (T).

  • Symbol: \sim

Example: Negation
  • Proposition: Amanda is the fastest runner on the team.

  • Negation: Amanda is not the fastest runner on the team.

  • If the negation is false, the original statement must be true, meaning that Amanda is the fastest runner on the team.

Double Negation

  • The double negation of a proposition pp, not not pp, has the same truth value as pp.

Example: Radiation and Health
  • Original statement: "My opinion is that it’s unlikely that there is no association."

  • Analysis:

    • pp = it’s likely that there is an association (between low-level radiation and cancer)

    • "unlikely" gives us: it’s unlikely that there is an association, which is p\sim p.

    • "no association" transforms the last statement into the original statement, it’s unlikely that there is no association, which is p\sim \sim p.

  • Conclusion: the scientist believes it likely that there is an association between low-level radiation and cancer among younger workers, because the double negation has the same truth value as the original proposition.

Logical Connectors

  • Propositions are often joined with logical connectors—words such as and, or, and if…then.

  • Example:

    • pp = I won the game.

    • qq = It was fun.

    • I won the game and it was fun.

    • I won the game or it was fun.

    • If I won the game, then it was fun.

And Statements (Conjunctions)

  • Given two propositions pp and qq, the statement pp and qq is called their conjunction.

  • It is true only if pp and qq are both true.

  • Symbol: \land

Example: And Statements
  • a. The capital of France is Paris and Antarctica is cold.

    • Both propositions are true, so their conjunction is also true.

  • b. The capital of France is Paris and the capital of America is Madrid.

    • The first proposition is true, but the second is false. Therefore, their conjunction is false.

Two Types of Or

  • An inclusive or means “either or both.”

  • An exclusive or means “one or the other, but not both.”

  • In logic, assume or is inclusive unless told otherwise.

The Logic of Or (Disjunctions)

  • Given two propositions pp and qq, the statement pp or qq is called their disjunction.

  • It is true unless pp and qq are both false.

  • Symbol: \lor

Example: Smart Cows?
  • Statement: Airplanes can fly or cows can read.

  • The statement is a disjunction of two propositions: (1) airplanes can fly; (2) cows can read.

  • The first proposition is true, while the second is false, which makes the disjunction pqp \lor q true.

  • That is, the statement Airplanes can fly or cows can read is true.

The Logic of If . . . Then Statements (Conditionals)

  • A statement of the form if p, then q is called a conditional proposition (or implication).

  • It is true unless pp is true and qq is false.

    • Proposition pp is called the hypothesis.

    • Proposition qq is called the conclusion.

Alternative Phrasings of Conditionals

The following are common alternative ways of stating if p, then q:

  • pp is sufficient for qq

  • pp will lead to qq

  • pp implies qq

  • qq is necessary for pp

  • qq if pp

  • qq whenever pp

Variations on the Conditional

Conditional

If pp, then qq

Converse

If qq, then pp

Inverse

If not pp, then not qq

Contrapositive

If not qq, then not pp

Example (If it is raining, then I will bring an umbrella to work.)

Converse

If I bring an umbrella to work, then it must be raining.

Inverse

If it is not raining, then I will not bring an umbrella to work.

Contrapositive

If I do not bring an umbrella to work, then it must not be raining.

Logical Equivalence

  • Two statements are logically equivalent if they share the same truth values.

  • Original and Contrapositive are logically equivalent.

  • Converse and Inverse are logically equivalent.

Example: Logical Equivalence

Consider the true statement if a creature is a whale, then it is a mammal.

  • Conditional: If a creature is a whale, then it is a mammal. (True)

  • Converse: If a creature is a mammal, then it is a whale. (False, because most mammals are not whales.)

  • Inverse: If a creature is not a whale, then it is not a mammal. (False, for example, dogs are not whales, but they are mammals.)

  • Contrapositive: If a creature is not a mammal, then it is not a whale. (True, because all whales are mammals.)

  • The original proposition and its contrapositive have the same truth value and are logically equivalent.

  • Similarly, the converse and inverse have the same truth value and are logically equivalent.