Formal Logic I Unit 3 Review: Truth Functions and Truth Tables

What's This All About?

• Truth functions and truth tables provide a systematic way to analyze the logical structure of statements and arguments in formal logic
• They allow us to determine the truth values of complex propositions based on the truth values of their constituent parts
• Truth functions define how the truth value of a compound proposition depends on the truth values of its simpler components
• Truth tables visually represent all possible combinations of truth values for the propositions involved and the resulting truth value of the compound proposition
• Mastering truth functions and truth tables is essential for evaluating the validity of arguments and understanding the logical relationships between statements

Key Concepts and Definitions

• Proposition: a declarative sentence that is either true or false, but not both (cannot be both true and false simultaneously)
• Truth value: the property of a proposition being either true (T) or false (F)
• Logical connectives: symbols used to combine propositions to create compound propositions (e.g., $\wedge$ for conjunction, $\vee$ for disjunction, $\rightarrow$ for conditional, $\leftrightarrow$ for biconditional, and $\neg$ for negation)
  • Conjunction ($\wedge$): a compound proposition that is true only when both of its constituent propositions are true (p and q)
  • Disjunction ($\vee$): a compound proposition that is true when at least one of its constituent propositions is true (p or q)
  • Conditional ($\rightarrow$): a compound proposition that is false only when the antecedent (p) is true and the consequent (q) is false (if p then q)
  • Biconditional ($\leftrightarrow$): a compound proposition that is true when both constituent propositions have the same truth value (p if and only if q)
  • Negation ($\neg$): an operator that reverses the truth value of a proposition (not p)
• Tautology: a compound proposition that is always true, regardless of the truth values of its constituent propositions
• Contradiction: a compound proposition that is always false, regardless of the truth values of its constituent propositions

Truth Functions Explained

• A truth function is a function that takes the truth values of propositions as input and produces a truth value as output
• The output truth value depends solely on the input truth values and the specific logical connective used
• For example, the conjunction (∧) truth function takes two input truth values (p and q) and produces a true output only when both p and q are true
• The number of rows in a truth table for a given truth function is determined by $2^n$, where n is the number of distinct propositions involved
• Each logical connective has its own unique truth function that defines the output truth value for every possible combination of input truth values
• Understanding the behavior of different truth functions is crucial for constructing and analyzing truth tables

Anatomy of a Truth Table

• A truth table is a tabular representation of a truth function, showing all possible combinations of input truth values and their corresponding output truth values
• The first columns of the table represent the input propositions (e.g., p, q, r)
• The next columns represent the compound propositions formed by combining the input propositions using logical connectives
• The final column represents the output truth value of the entire compound proposition
• Each row of the table represents a unique combination of truth values for the input propositions
• The number of rows in a truth table is determined by $2^n$, where n is the number of distinct input propositions
• Truth tables allow us to systematically evaluate the truth value of a compound proposition for every possible scenario

Building Truth Tables Step-by-Step

1. Identify the input propositions and list them in the first columns of the table
2. Determine the number of rows needed based on the number of input propositions ($2^n$, where n is the number of distinct propositions)
3. Fill in the truth values for the input propositions in a systematic manner, ensuring all possible combinations are represented
   • For two propositions (p, q), the truth values would be: (T, T), (T, F), (F, T), (F, F)
   • For three propositions (p, q, r), the truth values would be: (T, T, T), (T, T, F), (T, F, T), (T, F, F), (F, T, T), (F, T, F), (F, F, T), (F, F, F)
4. Write the compound proposition using the appropriate logical connectives in the next column
5. Evaluate the truth value of the compound proposition for each row based on the truth function of the logical connectives used and the input truth values in that row
6. Fill in the output truth values in the final column of the table
7. Analyze the completed truth table to determine the logical properties of the compound proposition (e.g., tautology, contradiction, contingency)

Common Truth Functions and Their Tables

• Conjunction (∧):

  • p ∧ q is true only when both p and q are true
  • Truth table:

    p	q	p ∧ q
    T	T	T
    T	F	F
    F	T	F
    F	F	F

• Disjunction (∨):

  • p ∨ q is true when at least one of p or q is true
  • Truth table:

    p	q	p ∨ q
    T	T	T
    T	F	T
    F	T	T
    F	F	F

• Conditional (→):

  • p → q is false only when p is true and q is false
  • Truth table:

    p	q	p → q
    T	T	T
    T	F	F
    F	T	T
    F	F	T

• Biconditional (↔):

  • p ↔ q is true when p and q have the same truth value
  • Truth table:

    p	q	p ↔ q
    T	T	T
    T	F	F
    F	T	F
    F	F	T

• Negation (¬):

  • ¬p is true when p is false, and false when p is true
  • Truth table:

    p	¬p
    T	F
    F	T

Analyzing Arguments with Truth Tables

• Truth tables can be used to evaluate the validity of arguments by representing the premises and conclusion as compound propositions
• To analyze an argument using a truth table:
  1. Identify the premises and conclusion of the argument
  2. Assign propositional variables to each simple proposition in the argument
  3. Represent the premises and conclusion using logical connectives
  4. Construct a truth table that includes columns for the premises, conclusion, and the conjunction of the premises (P1 ∧ P2 ∧ ... ∧ Pn)
  5. Evaluate the truth values of the premises, conclusion, and their conjunction for each row of the table
  6. If there is a row where all the premises are true (the conjunction of the premises is true) but the conclusion is false, the argument is invalid
  7. If there is no such row, the argument is valid
• Truth tables provide a systematic and conclusive method for determining the validity of arguments in propositional logic

Practice Problems and Tips

• Start with simple propositions and truth functions, gradually increasing complexity as you become more comfortable
• When building truth tables, ensure that you have included all possible combinations of truth values for the input propositions
• Double-check your evaluations of compound propositions using the truth functions of the logical connectives
• Practice translating natural language statements into propositional logic using appropriate logical connectives
• Analyze truth tables to identify tautologies, contradictions, and contingent propositions
• When using truth tables to evaluate arguments, pay close attention to rows where the premises are all true, and check the truth value of the conclusion in those rows
• Work through various examples of arguments to familiarize yourself with the process of using truth tables to assess validity
• Collaborate with classmates or study groups to discuss and compare your truth tables and analyses
• Seek clarification from your instructor or teaching assistants if you encounter difficulties or have questions about specific concepts or problems