12.3 Formal Logic: Connectives (And/Or/If-Then) & Quantifiers (All/Some/None)

12.3 Formal Logic: Connectives (And/Or/If-Then) & Quantifiers (All/Some/None)

Formal Deductive Reasoning on the CBEST

Within the CBEST Mathematics framework, Skill Factor 3 (Numerical and Graphic Relationships) explicitly incorporates formal deductive logic and applied symbolic reasoning. These test items do not evaluate complex philosophical proofs or mathematical abstractions; rather, they measure an educator's ability to analyze school district policies, prerequisite credential regulations, and administrative guidelines with rigorous logical precision.

On the CBEST, you must strictly distinguish between empirical plausibility and formal logical necessity. A deduction is not valid simply because it sounds sensible, fair, or true in everyday public school life. A deduction is formally valid if and only if the truth of the premises guarantees the truth of the conclusion under every conceivable configuration. Never import outside assumptions or subjective opinions into a logic item.

Logical Connectives: Conjunction, Disjunction, and Truth Conditions

Compound statements are constructed by joining elementary propositions (p, q) with logical operators known as connectives.

Conjunction: "AND" (p ∧ q)

A conjunction asserts that two conditions hold simultaneously. A conjunction is true if and only if both component statements are true. If even one component is false, the entire conjunction is false.

• Example: "A credential candidate must complete student teaching AND pass the CBEST."
• If a candidate passes the CBEST but fails to complete student teaching, the requirement is unsatisfied (false).

Disjunction: "OR" (p ∨ q)

In everyday English, the word "or" is sometimes used exclusively (e.g., "You may choose soup or salad, but not both"). However, in formal mathematics and on the CBEST, disjunction is always inclusive. An inclusive disjunction is true if p is true, if q is true, or if both p and q are true. It is false only when both components are false.

• Example: "To qualify for the field trip subsidy, a student must be on the honor roll OR participate in student council."
• A student on the honor roll qualifies. A student in student council qualifies. A student who is both on the honor roll and in student council also qualifies.

Summary Truth Table for Basic Connectives

De Morgan's Laws for Compound Negations

When negating compound statements, the connective flips:

1. Negating a Conjunction: ~(p ∧ q) ≡ ~ p ∨ ~ q
   • Plain English: The statement "It is false that Maria is both a math teacher and a soccer coach" means "Maria is not a math teacher, OR Maria is not a soccer coach (or neither)."
2. Negating a Disjunction: ~(p ∨ q) ≡ ~ p ∧ ~ q
   • Plain English: The statement "It is false that Jason will attend UCLA or UC Berkeley" means "Jason will NOT attend UCLA AND Jason will NOT attend UC Berkeley."

Conditional Statements and the Contrapositive Rule

A conditional statement takes the form "If p, then q" (written symbolically as p → q):

• Hypothesis (Antecedent): The condition following "if" (p).
• Conclusion (Consequent): The result following "then" (q).

The conditional p → q establishes that whenever p occurs, q is guaranteed to occur. However, if p does not occur, the conditional statement makes no claim whatsoever regarding whether q occurs.

The Three Derived Variations of p → q

Given the true conditional statement "If p, then q", three related statements can be formed:

The Immutable Contrapositive Law

On the CBEST, whenever a question asks: "If statement S is true, which of the following MUST also be true?", your immediate search should focus on the contrapositive:

1. Identify the hypothesis (p) and conclusion (q).
2. Negate both parts (~ p and ~ q).
3. Reverse their order: ~ q → ~ p.

Concrete Educational Example:

• Given Premise (p → q): "If a teacher is assigned as a mentor, then that teacher has earned tenure."
• Contrapositive (~ q → ~ p): "If a teacher has NOT earned tenure, then that teacher is NOT assigned as a mentor." (This statement must be true).
• Converse (q → p) Fallacy: "If a teacher has earned tenure, then that teacher is assigned as a mentor." (Invalid: Tenured teachers may choose not to serve as mentors).
• Inverse (~ p → ~ q) Fallacy: "If a teacher is not assigned as a mentor, then that teacher has not earned tenure." (Invalid: Non-mentors may still be tenured).

Hypothetical Syllogism (Chain Reasoning)

If two conditional statements link sequentially such that the conclusion of the first is the hypothesis of the second: $\text{Premise 1: } p \to q \quad \text{and} \quad \text{Premise 2: } q \to r \implies \text{Valid Conclusion: } p \to r$ The contrapositive of this linked conclusion, ~ r → ~ p, is also automatically valid.

Quantifiers and the Rules of Negation

Quantifiers specify the quantity of specimens in a domain that satisfy a given predicate:

• Universal Quantifiers: Apply to every member ("All", "Every", "Each", "No", "None").
• Existential Quantifiers: Apply to at least one member ("Some", "At least one", "There exists").

The Fundamental Negation Rules

A universal statement is not negated by another universal statement. To prove "All swans are white" false, you do not need to prove that "No swans are white"; you only need to discover one single black swan.

Venn Diagram Models for Deductive Syllogisms

A syllogism is a deductive argument consisting of major premises and a necessary conclusion. The most reliable method for evaluating syllogisms without making logical errors is to translate the premises into Euler/Venn set diagrams.

Visualizing Set Relationships

1. "All A are B": Circle A is drawn entirely inside Circle B (A ⊆ B).
2. "No A are B": Circle A and Circle B are completely separate, disjoint circles (A ∩ B = ∅).
3. "Some A are B": Circle A and Circle B overlap in an intersection region (A ∩ B ≠ ∅).

The Universal Counterexample Test

To determine whether a conclusion is valid:

1. Sketch all possible geometric circle arrangements that satisfy every premise.
2. Attempt to draw a counterexample—an arrangement where all premises are completely satisfied, but the proposed conclusion fails.
3. If you can draw even one valid counterexample, the conclusion is logically invalid.
4. A conclusion is valid if and only if it holds true across every permissible circle diagram.