Study guide

1.2 Propositional Logic and Quantifiers

Gaokao Mathematics Exam

Track your progress as you read

Finished sections get a check mark.

1 Chapter 1: Sets, Logic, and Algebraic Foundations

1.1 Sets and Set Operations 1.2 Propositional Logic and Quantifiers 1.3 Inequalities and Absolute Value Equations

2 Chapter 2: Functions and Fundamental Properties

2.1 Concept, Domain, Range, and Mapping of Functions 2.2 Monotonicity, Parity, and Periodicity of Functions 2.3 Function Graphs, Transformations, and Zeros

3 Chapter 3: Exponential, Logarithmic, and Power Functions

3.1 Exponents and Exponential Functions 3.2 Logarithms and Logarithmic Functions 3.3 Power Functions and Comparative Growth Rates

4 Chapter 4: Complex Numbers and Quadratic Function Views

4.1 Algebraic and Geometric Representations of Complex Numbers 4.2 Complex Number Operations and Equations 4.3 Quadratic Equations and Inequalities from a Function Viewpoint

5 Chapter 5: Trigonometric Functions and Identities

5.1 Angles, Radians, and Unit Circle Definitions 5.2 Trigonometric Identities and Reduction Formulas 5.3 Addition, Subtraction, and Double-Angle Formulas 5.4 Graphs and Properties of Sine, Cosine, and Tangent Functions

6 Chapter 6: Triangles and Trigonometric Applications

6.1 Sine Theorem, Cosine Theorem, and Triangle Area Formulas 6.2 Solving Triangles and Comprehensive Geometric Applications 6.3 Practical Measurement, Optimization, and Trigonometric Modeling

7 Chapter 7: Sequences and Series

7.1 Arithmetic Sequences and Sums 7.2 Geometric Sequences and Sums 7.3 Recurrence Relations and General Term Determination 7.4 Advanced Summation Techniques and Sequence Applications

8 Chapter 8: Plane Vectors

8.1 Vector Concepts, Addition, Subtraction, and Scalar Multiplication 8.2 Coordinate Operations of Vectors 8.3 Dot Products, Angles, Vector Projections, and Geometric Applications

9 Chapter 9: Lines and Circles in Cartesian Coordinates

9.1 Equations of Straight Lines and Positional Relationships 9.2 Standard and General Equations of Circles 9.3 Positional Relationships Between Lines and Circles

10 Chapter 10: Conic Sections: Ellipses

10.1 Standard Equations and Definitions of Ellipses 10.2 Geometric Properties of Ellipses (Vertices, Foci, Eccentricity) 10.3 Intersection of Lines and Ellipses and Chord Problems

11 Chapter 11: Conic Sections: Hyperbolas and Parabolas

11.1 Hyperbola Definitions, Standard Equations, and Asymptotes 11.2 Parabola Definitions, Standard Equations, and Focal Properties 11.3 Unified Properties of Conic Sections and Trajectory Problems

12 Chapter 12: Solid Geometry: Three-Dimensional Figures

12.1 Prisms, Pyramids, Cylinders, Cones, and Spheres 12.2 Three-Dimensional Views and Cross-Sections 12.3 Surface Area and Volume Calculations

13 Chapter 13: Spatial Lines, Planes, and Spatial Vectors

13.1 Positional Relationships of Lines and Planes in Space 13.2 Parallelism and Perpendicularity Proofs in Solid Geometry 13.3 Spatial Coordinates and Spatial Vector Operations 13.4 Using Spatial Vectors to Compute Angles and Distances

14 Chapter 14: Permutations, Combinations, and Binomial Theorem

14.1 Fundamental Counting Principles (Addition and Multiplication Rules) 14.2 Permutations and Combinations 14.3 Binomial Theorem, Expansion Terms, and Coefficients

15 Chapter 15: Probability and Statistics

15.1 Classical Probability and Conditional Probability 15.2 Independent Events and Repeated Bernoulli Trials 15.3 Discrete Random Variables, Probability Distributions, Expectation, and Variance 15.4 Normal Distribution, Statistical Sampling, Correlation, and Regression

16 Chapter 16: Derivatives and Mathematical Modeling

16.1 Limit Concepts and Derivatives of Elementary Functions 16.2 Tangent Lines, Derivatives, Monotonicity, and Extremum Analysis 16.3 Optimization Problems and Curve Sketching with Derivatives 16.4 Real-World Mathematical Modeling and Problem Solving

1.2 Propositional Logic and Quantifiers

Key Takeaways Explain This Topic AI

A proposition is a declarative statement with a definitive truth value; compound propositions use connectives 'and' ( ∧ \land ∧ ), 'or' ( ∨ \lor ∨ ), and 'not' ( ¬ \neg ¬ ).

Propositional implication p ⟹ q p \implies q p ⟹ q corresponds set-theoretically to inclusion A ⊆ B A \subseteq B A ⊆ B : p p p is sufficient for q q q , and q q q is necessary for p p p .

A proposition p ⟹ q p \implies q p ⟹ q and its contrapositive ¬ q ⟹ ¬ p \neg q \implies \neg p ¬ q ⟹ ¬ p are logically equivalent, sharing identical truth values under all interpretations.

Universal ( ∀ \forall ∀ ) and existential ( ∃ \exists ∃ ) quantifiers negate by swapping the quantifier type and negating the predicate: ¬ ( ∀ x ∈ M , p ( x ) ) ≡ ∃ x ∈ M , ¬ p ( x ) \neg(\forall x \in M, p(x)) \equiv \exists x \in M, \neg p(x) ¬ ( ∀ x ∈ M , p ( x )) ≡ ∃ x ∈ M , ¬ p ( x ) .

Last updated: July 2026

1.2 Propositional Logic and Quantifiers

Mathematical reasoning relies on rigorous logical structures. On the Gaokao, logic problems test your ability to evaluate the truth values of mathematical assertions, determine necessary and sufficient conditions, negate quantified statements, and execute contrapositive proofs. Mastery of logical connectives and quantifier negation ensures precise problem analysis across analysis, geometry, and algebra.

1. Propositions and Compound Logical Statements

A proposition (命题) is a declarative statement that is either definitively true (T) or definitively false (F), but not both. Truth or falsity is called the truth value (真假值) of the proposition.

Simple and Compound Propositions

Simple Proposition: A single assertion containing no logical operators (e.g., " 2 2 2 is an even prime number").

Compound Proposition: Formed by combining simple propositions using logical connectives: and (且, ∧ \land ∧ ) , or (或, ∨ \lor ∨ ) , and not (非, ¬ \neg ¬ ) .

Truth Rules for Compound Propositions

Conjunction ( p ∧ q p \land q p ∧ q ): True if and only if both p p p and q q q are true. If either is false, p ∧ q p \land q p ∧ q is false.

Disjunction ( p ∨ q p \lor q p ∨ q ): True if at least one of p p p or q q q is true. False only when both p p p and q q q are false.

Negation ( ¬ p \neg p ¬ p ): Reverses the truth value of p p p . If p p p is true, ¬ p \neg p ¬ p is false; if p p p is false, ¬ p \neg p ¬ p is true.

Loading diagram... Equivalence between Logical Implication and Set Inclusion

2. Sufficient, Necessary, and Necessary-and-Sufficient Conditions

In mathematical statements of the form "If p p p , then q q q " ( p ⟹ q p \implies q p ⟹ q ):

Definitions

Sufficient Condition (充分条件): If p ⟹ q p \implies q p ⟹ q is true, then p p p is a sufficient condition for q q q .

Necessary Condition (必要条件): If p ⟹ q p \implies q p ⟹ q is true, then q q q is a necessary condition for p p p .

Necessary and Sufficient Condition (充要条件): If both p ⟹ q p \implies q p ⟹ q and q ⟹ p q \implies p q ⟹ p are true ( p ⟺ q p \iff q p ⟺ q ), then p p p is a necessary and sufficient condition (equivalent condition) for q q q .

Set-Theoretic Interpretation (小范围推大范围)

Let A = { x ∣ p ( x ) } A = \{x \mid p(x)\} A = { x ∣ p ( x )} be the solution set where condition p p p holds, and B = { x ∣ q ( x ) } B = \{x \mid q(x)\} B = { x ∣ q ( x )} be the solution set where condition q q q holds:

If A ⊆ B A \subseteq B A ⊆ B , then p ⟹ q p \implies q p ⟹ q (so p p p is sufficient for q q q ).

If B ⊆ A B \subseteq A B ⊆ A , then q ⟹ p q \implies p q ⟹ p (so p p p is necessary for q q q ).

If A = B A = B A = B , then p ⟺ q p \iff q p ⟺ q (so p p p is necessary and sufficient for q q q ).

If A ⊊ B A \subsetneq B A ⊊ B , then p p p is a sufficient but not necessary condition for q q q .

If B ⊊ A B \subsetneq A B ⊊ A , then p p p is a necessary but not sufficient condition for q q q .

If neither A ⊆ B A \subseteq B A ⊆ B nor B ⊆ A B \subseteq A B ⊆ A , then p p p is neither sufficient nor necessary for q q q .

3. Four Forms of Propositions and Contrapositive Equivalence

For a conditional proposition "If p p p , then q q q ":

Original Proposition (原命题): If p p p , then q q q ( p ⟹ q p \implies q p ⟹ q ).

Converse Proposition (逆命题): If q q q , then p p p ( q ⟹ p q \implies p q ⟹ p ).

Inverse Proposition (否命题): If ¬ p \neg p ¬ p , then ¬ q \neg q ¬ q ( ¬ p ⟹ ¬ q \neg p \implies \neg q ¬ p ⟹ ¬ q ).

Contrapositive Proposition (逆否命题): If ¬ q \neg q ¬ q , then ¬ p \neg p ¬ p ( ¬ q ⟹ ¬ p \neg q \implies \neg p ¬ q ⟹ ¬ p ).

Logical Equivalence Principle

The Original Proposition and its Contrapositive are logically equivalent: ( p ⟹ q ) ≡ ( ¬ q ⟹ ¬ p ) (p \implies q) \equiv (\neg q \implies \neg p) ( p ⟹ q ) ≡ ( ¬ q ⟹ ¬ p ) .

The Converse Proposition and Inverse Proposition are logically equivalent: ( q ⟹ p ) ≡ ( ¬ p ⟹ ¬ q ) (q \implies p) \equiv (\neg p \implies \neg q) ( q ⟹ p ) ≡ ( ¬ p ⟹ ¬ q ) .

Gaokao Technique: When proving a statement p ⟹ q p \implies q p ⟹ q directly is difficult, prove its contrapositive ¬ q ⟹ ¬ p \neg q \implies \neg p ¬ q ⟹ ¬ p instead.

  • 4. Universal and Existential Quantifiers and Their Negations
  • Definitions

Universal Quantifier (全称量词): "For all", "For every", denoted ∀ \forall ∀ .

Universal Proposition: ∀ x ∈ M , p ( x ) \forall x \in M, p(x) ∀ x ∈ M , p ( x ) .

Existential Quantifier (存在量词): "There exists", "At least one", denoted ∃ \exists ∃ .

Existential Proposition: ∃ x ∈ M , p ( x ) \exists x \in M, p(x) ∃ x ∈ M , p ( x ) .

Negation Rules for Quantified Propositions

To negate a quantified proposition, perform two simultaneous transformations: swap the quantifier symbol and negate the predicate property , keeping the domain unchanged:

¬ ( ∀ x ∈ M , p ( x ) ) ≡ ∃ x ∈ M , ¬ p ( x ) \neg \left( \forall x \in M, p(x) \right) \equiv \exists x \in M, \neg p(x) ¬ ( ∀ x ∈ M , p ( x ) ) ≡ ∃ x ∈ M , ¬ p ( x )

¬ ( ∃ x ∈ M , p ( x ) ) ≡ ∀ x ∈ M , ¬ p ( x ) \neg \left( \exists x \in M, p(x) \right) \equiv \forall x \in M, \neg p(x) ¬ ( ∃ x ∈ M , p ( x ) ) ≡ ∀ x ∈ M , ¬ p ( x )

Summary of Quantifier Forms, Negations, and Logical Equivalences

Proposition Form Symbolic Representation Negation Equivalent Form

Universal Proposition ∀ x ∈ M , p ( x ) \forall x \in M, p(x) ∀ x ∈ M , p ( x ) ∃ x ∈ M , ¬ p ( x ) \exists x \in M, \neg p(x) ∃ x ∈ M , ¬ p ( x ) Holds for all elements

Existential Proposition ∃ x ∈ M , p ( x ) \exists x \in M, p(x) ∃ x ∈ M , p ( x ) ∀ x ∈ M , ¬ p ( x ) \forall x \in M, \neg p(x) ∀ x ∈ M , ¬ p ( x ) Holds for at least one element

Original Implication p ⟹ q p \implies q p ⟹ q p ∧ ¬ q p \land \neg q p ∧ ¬ q ¬ q ⟹ ¬ p \neg q \implies \neg p ¬ q ⟹ ¬ p (Contrapositive)

Converse Implication q ⟹ p q \implies p q ⟹ p q ∧ ¬ p q \land \neg p q ∧ ¬ p ¬ p ⟹ ¬ q \neg p \implies \neg q ¬ p ⟹ ¬ q (Inverse)

  • 5. Worked Gaokao Exam Examples
  • Worked Example 1: Necessary and Sufficient Condition Analysis

Problem: Determine whether condition p : m > 2 p: m > 2 p : m > 2 is a sufficient, necessary, or充要 (necessary and sufficient) condition for condition q q q : the quadratic equation x 2 + 2 x + m = 0 x^2 + 2x + m = 0 x 2 + 2 x + m = 0 has no real roots.

Solution:

Step 1: Simplify condition q q q . The quadratic equation x 2 + 2 x + m = 0 x^2 + 2x + m = 0 x 2 + 2 x + m = 0 has no real roots if and only if its discriminant Δ < 0 \Delta < 0 Δ < 0 : Δ = b 2 − 4 a c = 2 2 − 4 ( 1 ) ( m ) = 4 − 4 m < 0 \Delta = b^2 - 4ac = 2^2 - 4(1)(m) = 4 - 4m < 0 Δ = b 2 − 4 a c = 2 2 − 4 ( 1 ) ( m ) = 4 − 4 m < 0 Solving 4 − 4 m < 0 ⟹ 4 m > 4 ⟹ m > 1 4 - 4m < 0 \implies 4m > 4 \implies m > 1 4 − 4 m < 0 ⟹ 4 m > 4 ⟹ m > 1 .

Thus, condition q q q is equivalent to m > 1 m > 1 m > 1 .

Step 2: Compare the solution sets of p p p and q q q . Let A = { m ∣ m > 2 } = ( 2 , + ∞ ) A = \{m \mid m > 2\} = (2, +\infty) A = { m ∣ m > 2 } = ( 2 , + ∞ ) be the set for p p p .

Let B = { m ∣ m > 1 } = ( 1 , + ∞ ) B = \{m \mid m > 1\} = (1, +\infty) B = { m ∣ m > 1 } = ( 1 , + ∞ ) be the set for q q q .

Step 3: Analyze set inclusion. Notice that ( 2 , + ∞ ) ⊊ ( 1 , + ∞ ) (2, +\infty) \subsetneq (1, +\infty) ( 2 , + ∞ ) ⊊ ( 1 , + ∞ ) , which means A ⊊ B A \subsetneq B A ⊊ B .

Since A ⊆ B A \subseteq B A ⊆ B , p ⟹ q p \implies q p ⟹ q is true (if m > 2 m > 2 m > 2 , then m > 1 m > 1 m > 1 is guaranteed).

Since B ⊈ A B \not\subseteq A B  ⊆ A , q ⟹ p q \implies p q ⟹ p is false (for example, if m = 1.5 m = 1.5 m = 1.5 , q q q holds but p p p fails).

Conclusion: Condition p p p ( m > 2 m > 2 m > 2 ) is a sufficient but not necessary condition for condition q q q .

Worked Example 2: Quantifier Negation and Parameter Separation

Problem: Given that the proposition p : ∀ x ∈ [ 1 , 2 ] , x 2 − a x + 1 ≥ 0 p: \forall x \in [1, 2], x^2 - ax + 1 \ge 0 p : ∀ x ∈ [ 1 , 2 ] , x 2 − a x + 1 ≥ 0 is true, find the range of real values of the parameter a a a .

Solution:

Step 1: Reformulate the universal proposition using parameter separation. The inequality x 2 − a x + 1 ≥ 0 x^2 - ax + 1 \ge 0 x 2 − a x + 1 ≥ 0 holds for all x ∈ [ 1 , 2 ] x \in [1, 2] x ∈ [ 1 , 2 ] .

Since x ∈ [ 1 , 2 ] x \in [1, 2] x ∈ [ 1 , 2 ] , we know x > 0 x > 0 x > 0 . We can isolate a a a by adding a x ax a x to both sides and dividing by x x x : a x ≤ x 2 + 1 ⟹ a ≤ x 2 + 1 x = x + 1 x ax \le x^2 + 1 \implies a \le \frac{x^2 + 1}{x} = x + \frac{1}{x} a x ≤ x 2 + 1 ⟹ a ≤ x x 2 + 1 ​ = x + x 1 ​

Step 2: Apply the maximum/minimum principle for universal conditions. For a ≤ f ( x ) a \le f(x) a ≤ f ( x ) to hold for all x ∈ [ 1 , 2 ] x \in [1, 2] x ∈ [ 1 , 2 ] , a a a must be less than or equal to the minimum value of f ( x ) = x + 1 x f(x) = x + \frac{1}{x} f ( x ) = x + x 1 ​ on the interval [ 1 , 2 ] [1, 2] [ 1 , 2 ] : a ≤ min ⁡ x ∈ [ 1 , 2 ] ( x + 1 x ) a \le \min_{x \in [1, 2]} \left( x + \frac{1}{x} \right) a ≤ x ∈ [ 1 , 2 ] min ​ ( x + x 1 ​ )

Step 3: Find the minimum of f ( x ) = x + 1 x f(x) = x + \frac{1}{x} f ( x ) = x + x 1 ​ on [ 1 , 2 ] [1, 2] [ 1 , 2 ] . By the AM-GM inequality, for x > 0 x > 0 x > 0 : x + 1 x ≥ 2 x ⋅ 1 x = 2 x + \frac{1}{x} \ge 2 \sqrt{x \cdot \frac{1}{x}} = 2 x + x 1 ​ ≥ 2 x ⋅ x 1 ​ ​ = 2 Equality holds when x = 1 x ⟹ x 2 = 1 ⟹ x = 1 x = \frac{1}{x} \implies x^2 = 1 \implies x = 1 x = x 1 ​ ⟹ x 2 = 1 ⟹ x = 1 .

Since x = 1 ∈ [ 1 , 2 ] x = 1 \in [1, 2] x = 1 ∈ [ 1 , 2 ] , the minimum value on [ 1 , 2 ] [1, 2] [ 1 , 2 ] is indeed 2 2 2 .

Step 4: State the final parameter range. a ≤ 2 ⟹ a ∈ ( − ∞ , 2 ] a \le 2 \implies a \in (-\infty, 2] a ≤ 2 ⟹ a ∈ ( − ∞ , 2 ]