Study guide
12.3 Formal Logic: Connectives (And/Or/If-Then) & Quantifiers (All/Some/None)
California Basic Educational Skills Test CBEST
Track your progress as you read
Finished sections get a check mark.
1 Introduction, Scoring Architecture & California BSR Pathways
1.1 CBEST Format, Appointment Scheduling & Section-by-Section Timing 1.2 The 123-Point Passing Standard, Section Scaled Scores & 37-Point Rule 1.3 CTC Basic Skills Requirement (CL-667), the SB 153 Degree Option & the Nine Statutory Pathways
2 Reading: Critical Analysis & Argument Evaluation
2.1 Author's Main Thesis, Supporting Evidence & Structural Hierarchy 2.2 Identifying Unstated Assumptions & Evaluating Premise-Conclusion Validity 2.3 Statements That Strengthen or Weaken Arguments & Logical Fallacies
3 Reading: Author Tone, Bias & Multi-Text Comparative Analysis
3.1 Detecting Author Tone, Attitude, Bias & Intended Audience 3.2 Distinguishing Objective Facts from Subjective Interpretations & Value Judgments 3.3 Synthesizing Paired Passages, Contradictions & Differing Points of View
4 Reading: Comprehension, Sequencing & Inference Skills
4.1 Literal Comprehension, Chronology & Multi-Step Process Tracking 4.2 Formulating Inferences, Predictions & Cause-and-Effect Relationships 4.3 Accurate Paraphrasing, Summarizing & Translating into Graphic Organizers
5 Reading: Contextual Vocabulary & Research Reference Skills
5.1 Contextual Meaning, Structural Word Analysis, Prefixes & Latin/Greek Roots 5.2 Figurative Devices, Idiomatic Expressions & Discourse Transition Markers 5.3 Using Reference Materials, Indexes, Tables of Contents & Reading Visual Data
6 Mathematics: Estimation Strategies & Mental Math
6.1 Pre-Computation Bounding & Reasonableness Checks Without a Calculator 6.2 Estimation Methods for Large Additions, Subtractions, Products & Quotients 6.3 Rounding Principles, Decimal Places & Contextual Precision Rules
7 Mathematics: Measurement Systems & Applied Geometry
7.1 U.S. Customary Units of Length, Weight, Capacity & Temperature Conversions 7.2 Perimeter, Circumference, Area of Polygons & Basic Geometric Shapes 7.3 Elapsed Time, Timetables, Scheduling & Multi-Rate Work Planning
8 Mathematics: Descriptive Statistics & Educational Test Scores
8.1 Mean, Median, Mode, Weighted Averages & Range Calculations 8.2 Elementary Probability, Simple and Compound Events & Likely Outcomes 8.3 Educational Statistics: Percentiles, Stanines (1–9) & Standardized Test Reports
9 Mathematics: Whole Number Arithmetic & Signed Integers
9.1 Multi-Digit Arithmetic, Factorization & Order of Operations (PEMDAS) 9.2 Operations with Positive and Negative Numbers & Integer Rules 9.3 Number Line Relationships, Absolute Value, Inequalities & Distance
10 Mathematics: Fractions, Decimals, Ratios & Percentages
10.1 Equivalent Fractions, Common Denominators, Mixed Numbers & Operations 10.2 Decimal Operations, Place Values & Fraction-Decimal-Percent Conversion 10.3 Ratios, Unit Rates, Proportions & Scale Factor Calculations 10.4 Percent Computation, Base Values, Percent Increase/Decrease & Discounts
11 Mathematics: Algebraic Reasoning & Practical Problem Solving
11.1 Translating Real-World Problem Statements into Algebraic Expressions 11.2 Solving One-Variable Linear Equations & Basic Linear Inequalities 11.3 Applied Consumer Math, Supplier Invoicing, Unit Pricing & Budgeting
12 Mathematics: Tables, Graphs & Applied Logical Reasoning
12.1 Extracting Table Data, Spreadsheet Formats & Solving for Missing Entries 12.2 Analyzing Bar Charts, Line Graphs, Circle Graphs & Comparative Trends 12.3 Formal Logic: Connectives (And/Or/If-Then) & Quantifiers (All/Some/None)
13 Writing: Rubric Criteria, Rhetorical Architecture & Mechanics
13.1 The CBEST 4-Point Holistic Rubric & Six Core Diagnostic Performance Dimensions 13.2 Rhetorical Force, Thesis Formulation, Paragraph Transitions & Essay Unity 13.3 Syntactic Variety, Active Voice, Standard Usage & Avoiding Common Grammar Traps
14 Writing: Essay Types, Scored Models & Exam-Day Strategy
14.1 Type I Essay Masterclass: Personal Experience Narrative & Reflective Insights 14.2 Type II Essay Masterclass: Expository Analysis of Statements & Issues 14.3 Benchmark Essay Analysis: Comparing Level 4, 3, 2, and 1 Student Models 14.4 45-Minute Timed Essay Strategy, Outlining Protocols & Proofreading Checklists
12.3 Formal Logic: Connectives (And/Or/If-Then) & Quantifiers (All/Some/None)
Key Takeaways Explain This Topic AI
A conditional proposition (p -> q) is logically equivalent exclusively to its contrapositive (~q -> ~p); the converse and inverse are invalid fallacies.
The logical connective 'OR' is inclusive by default on standardized exams, requiring at least one of the conditions to be satisfied.
Quantifiers negate across categories: 'All A are B' is negated by 'Some A are not B', while 'No A are B' is negated by 'Some A are B'.
Syllogistic validity requires that a conclusion must hold true under every possible Venn diagram arrangement that satisfies the premises.
Last updated: September 2026
- 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
- Proposition p Proposition q Conjunction: p ∧ q ("AND") Disjunction: p ∨ q ("OR") Negation: ~ p ("NOT p")
- True True True True False
- True False False True False
- False True False True True
- False False False False True
- De Morgan's Laws for Compound Negations
When negating compound statements, the connective flips:
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)."
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:
- Variation Symbolic Form Construction Logical Status Relative to p → q
- Original Conditional p → q "If p, then q" True (Given Premise)
- Converse q → p Switch hypothesis and conclusion INVALID (Formal Fallacy: Affirming Consequent)
- Inverse ~ p → ~ q Negate hypothesis and conclusion INVALID (Formal Fallacy: Denying Antecedent)
Contrapositive ~ q → ~ p Switch AND negate both components LOGICALLY EQUIVALENT (Always shares identical truth value)
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 :
Identify the hypothesis (p) and conclusion (q).
Negate both parts (~ p and ~ q).
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: Premise 1: p → q and Premise 2: q → r ⟹ Valid Conclusion: p → r \text{Premise 1: } p \to q \quad \text{and} \quad \text{Premise 2: } q \to r \implies \text{Valid Conclusion: } p \to r Premise 1: p → q and Premise 2: q → r ⟹ Valid Conclusion: p → 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 .
- Original Quantified Statement Exact Logical Negation Common CBEST Misconception
- "All A are B" "Some A are NOT B" (At least one A is not B) Incorrectly guessing "No A are B"
- "No A are B" "Some A are B" (At least one A is B) Incorrectly guessing "All A are B"
- "Some A are B" "No A are B" (All A are not B) Incorrectly guessing "Some A are not B"
- "Some A are NOT B" "All A are B" Incorrectly guessing "No A are not B"
- 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
"All A are B" : Circle A is drawn entirely inside Circle B (A ⊆ B).
"No A are B" : Circle A and Circle B are completely separate, disjoint circles (A ∩ B = ∅).
"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:
Sketch all possible geometric circle arrangements that satisfy every premise .
Attempt to draw a counterexample —an arrangement where all premises are completely satisfied, but the proposed conclusion fails.
If you can draw even one valid counterexample , the conclusion is logically invalid .
A conclusion is valid if and only if it holds true across every permissible circle diagram.