5.1 Conditional Logic and Truth Tables

Introduction to Conditional Logic

At the core of the Electronic Data Processing Test (EDPT) is the ability to parse, translate, and process formal logic rapidly. A major component of the Logical Analysis section involves Conditional Logic, which represents directional relationships between different propositions.

A standard conditional statement takes the form: "If P, then Q" (symbolized as P → Q). In this expression:

• P is the antecedent (or hypothesis). It is a sufficient condition for Q. If P is true, it guarantees that Q is also true.
• Q is the consequent (or conclusion). It is a necessary condition for P. For P to be true, Q must be true.

For example: "If the backup battery fails (P), then the primary database will shut down (Q)."

If we know the backup battery has failed, we can definitively conclude the database has shut down. However, if we only know the database has shut down, we cannot definitively conclude the backup battery failed; the database could have shut down due to a power surge, maintenance, or user error. This one-way directional relationship is the source of many traps on the EDPT, where questions are engineered to exploit intuitive but invalid logical leaps.

The Four Forms of Conditional Statements

When evaluating a conditional statement, you can generate three other related statements. Understanding which of these are logically equivalent to the original statement is crucial.

1. The Original: If P, then Q. (P → Q)
2. The Converse: If Q, then P. (Q → P) - Not logically equivalent!
3. The Inverse: If not P, then not Q. (~P → ~Q) - Not logically equivalent!
4. The Contrapositive: If not Q, then not P. (~Q → ~P) - Logically equivalent!

Let's apply this to our database example:

• Original: If the battery fails, the database shuts down. (True)
• Converse: If the database shuts down, the battery failed. (False, other causes exist)
• Inverse: If the battery does not fail, the database does not shut down. (False, could shut down due to other causes)
• Contrapositive: If the database does not shut down, the battery did not fail. (True! Because if the battery had failed, the database would have shut down.)

EDPT Strategy: Recognizing Formal Fallacies

The EDPT will deliberately test your ability to spot two primary logical fallacies related to conditional statements:

• Affirming the Consequent (Fallacy of the Converse): This occurs when a test question tells you "If P, then Q" and then states "Q is true" to tempt you into concluding "Therefore, P is true." (Equating the original to the converse).
• Denying the Antecedent (Fallacy of the Inverse): This occurs when you are told "If P, then Q" and "P is false," leading to the incorrect conclusion "Therefore, Q is false." (Equating the original to the inverse).

On the test, these fallacies are hidden in dense paragraphs of technical jargon. Your first step should always be to extract the underlying logical structure, strip away the narrative fluff, and look for these patterns.

Constructing Truth Tables

When dealing with multiple variables, Truth Tables provide a mathematical, foolproof way to evaluate logical expressions. They map out every possible combination of True (T) and False (F) for the variables involved.

Key Insight for the EDPT: Look at the last column (P → Q). A conditional statement is only false in exactly one scenario: when the hypothesis (P) is true, but the conclusion (Q) is false. If the hypothesis is false (the last two rows), the conditional statement is considered logically true by default (vacuous truth). This is a highly tested edge case on advanced logic exams.

Complex Logical Operators and De Morgan's Laws

To master EDPT questions, you must also be familiar with operators that modify conditional logic:

• AND (Conjunction, ∧): Both conditions must be met.
• OR (Disjunction, ∨): At least one condition must be met.
• XOR (Exclusive OR, ⊕): Exactly one condition must be met, but not both.
• NOT (Negation, ~ or ¬): Reverses the truth value.

De Morgan's Laws are essential tools for negating compound statements:

1. Negating an AND statement: ~(P AND Q) is logically equivalent to ~P OR ~Q.
2. Negating an OR statement: ~(P OR Q) is logically equivalent to ~P AND ~Q.

Consider a complex rule: "If the fire alarm triggers (P) AND the water valve is open (Q), then the sprinkler activates (R)." If you are told the sprinkler did not activate (~R), the contrapositive tells you that the antecedent (P AND Q) must be false: ~(P AND Q). Applying De Morgan's Laws, ~(P AND Q) becomes ~P OR ~Q. Therefore, you can definitively conclude that either the fire alarm did not trigger, OR the water valve was not open (or both).

Biconditional Logic (If and Only If)

A Biconditional Statement establishes that two propositions are mutually dependent, written as "P if and only if Q" (symbolized as P ↔ Q). This statement is a combination of two conditionals: (P → Q) AND (Q → P).

• A biconditional is true only when both P and Q have the same truth value (both true or both false).
• If P is true, Q must be true. If P is false, Q must be false. On the EDPT, biconditionals are often phrased as: "System A activates when, and only when, System B is online." This indicates a perfect logical lockstep.

Step-by-Step Problem Solving: Chaining and Logic Mapping

When faced with a paragraph of rules on the EDPT, you must work systematically:

1. Translate the Premises: Convert English sentences into symbols (e.g., A → B, ~C → A).
2. Write the Contrapositives: For every rule, write down its contrapositive immediately (e.g., ~B → ~A, ~A → C).
3. Chain the Rules: Connect rules where the conclusion of one is the hypothesis of another. For example, if we have ~B → ~A and ~A → C, we can chain them into the sequence ~B → C.
4. Evaluate the Fact Set: Match known facts against the chain. If you are told C is false (~C), you can work backward: ~C → A (via the contrapositive of ~C → A, which is ~A → C). So if ~C is true, then A is true. If A is false, then C is true.

Detailed Worked Example

Problem Scenario: If the security gateway is down (G), the secondary firewall goes offline (F). The database is backup-enabled (D) if and only if the storage server is active (S). The secondary firewall remains online unless the storage server is active.

Let's translate and solve step-by-step:

1. Identify the rules:

   • Rule 1: G → ~F (If gateway is down, firewall is offline).
     • Contrapositive 1: F → ~G (If firewall is online, gateway is up).
   • Rule 2: D ↔ S (Database is backup-enabled iff storage is active).
     • This means: D → S, S → D, ~D → ~S, ~S → ~D.
   • Rule 3: F remains online unless S is active.
     • In formal logic, "A unless B" translates to "If not B, then A" (~B → A). Thus, if the storage server is not active, the firewall remains online (~S → F).
     • Contrapositive 3: ~F → S (If the firewall is offline, the storage server is active).

2. Construct a Chain:

   • We can chain: G → ~F (Rule 1) and ~F → S (Rule 3) and S → D (Rule 2).
   • This creates a long logical chain: G → ~F → S → D.
   • Therefore, if the security gateway is down (G), the database must be backup-enabled (D).

3. Evaluate Options:

   • If the exam asks: "If the security gateway is down, which of the following must be true?" The answer is "The database is backup-enabled" (and also "The storage server is active").
   • If the exam asks: "If the database is not backup-enabled (~D), what can we conclude?" Working backward using contrapositives: ~D → ~S → F → ~G. Therefore, the security gateway must be up (not down).

By standardizing this process, you eliminate second-guessing and can answer each logic question in under 30 seconds, saving vital time for the math section.