Study guide
4.4 Venn Diagrams, Euler Circles, and Three-Set Quantifier Logic
Free FSOE Philippines Qualifying Test Study Guide 2026 Exam
Track your progress as you read
Finished sections get a check mark.
1 Chapter 1: Introduction, Administration, and Exam Architecture
1.1 FSOE Qualifying Test Structure, Logistics, and Testing Environment 1.2 Eligibility Requirements, Qualifications, and Application Process 1.3 80.00% Passing Standard, Career Service Eligibility, and Multi-Stage FSOE Progression
2 Chapter 2: Verbal Ability — Grammar, Structure, and Correct Usage
2.1 Subject-Verb Agreement, Inverted Sentences, and Parallel Structure 2.2 Verb Tense Consistency, Aspect, Mood, and Verbals 2.3 Pronoun Case, Relative Pronouns, and Modifier Placement 2.4 Idiomatic Prepositions, Diction, Word Choice, and Common Usage Errors
3 Chapter 3: Verbal Ability — Vocabulary, Organization, and Reading
3.1 Advanced Contextual Vocabulary, Etymology, Roots, Prefixes, and Suffixes 3.2 Paragraph Organization, Transitional Devices, Cohesion, and Sentence Ordering 3.3 Critical Reading Comprehension, Tone Analysis, Main Ideas, and Inferences 3.4 Filipino Language Proficiency: Wastong Gamit, Talasalitaan, at Pag-unawa sa Binasa
4 Chapter 4: Analytical Ability — Logical Reasoning and Deduction
4.1 Categorical Propositions, Syllogistic Forms, and Validity Tests 4.2 Conditional Logic (Modus Ponens, Modus Tollens) and Formal/Informal Fallacies 4.3 Evaluating Assumptions, Strengths of Arguments, and Sound Conclusions 4.4 Venn Diagrams, Euler Circles, and Three-Set Quantifier Logic
5 Chapter 5: Analytical Ability — Analogies, Patterns, and Data Interpretation
5.1 Verbal Analogies and Complex Semantic Relationships 5.2 Abstract Reasoning, Matrix Reasoning, and Numerical Sequence Patterns 5.3 Data Interpretation: Tables, Bar Graphs, Line Graphs, and Pie Charts 5.4 Data Sufficiency: Framework, Evaluation Strategy, and Answer Determination
6 Chapter 6: Numerical Ability — Arithmetic, Percentages, and Proportions
6.1 Number Properties, Divisibility Rules, Prime Factorization, and Mental Math Shortcuts 6.2 Fractions, Decimals, Percentages, and Percentage Change 6.3 Ratios, Proportions, Partitive Proportions, and Inverse/Direct Variation 6.4 Rate Problems, Combined Work Equations, and Weighted Mixture Calculations
7 Chapter 7: Numerical Ability — Algebraic Reasoning and Applied Problems
7.1 Linear Equations, Inequalities, and Systems of Equations 7.2 Applied Age Word Problems, Uniform Motion, and Relative Speed 7.3 Practical Financial Math, Simple Interest, Commercial Discounts, and Currency Conversions
8 Chapter 8: Managerial Ability — Leadership, Administration, and Problem Solving
8.1 Core Management Functions (POLC) and Organizational Governance Principles 8.2 Strategic Planning, Decision-Making Matrices, SWOT Analysis, and Risk Assessment 8.3 Situational Judgment in Public Administration and Crisis Response 8.4 Supervisory Practices, Team Motivation, and Workplace Conflict Resolution
9 Chapter 9: Supplemental Public-Service Ethics and Foreign-Service Context
9.1 Republic Act No. 6713: The Eight Norms of Conduct and Public Duties 9.2 Prohibited Acts, Gifts, Conflict of Interest, Divestment, and SALN Compliance 9.3 Republic Act No. 7157 (Philippine Foreign Service Act of 1991): Ranks, BFSE, and Structure 9.4 Diplomatic Mission Functions, Consular Assistance to Nationals, and Crisis Leadership
4.4 Venn Diagrams, Euler Circles, and Three-Set Quantifier Logic
Key Takeaways Explain This Topic AI
Venn diagrams and Euler circles transform categorical and quantifier logic into visual set theory: shading represents empty regions (zero members), while an 'X' indicates guaranteed existence of at least one member.
The four categorical propositions translate into precise two-set diagrams: A (All S are P) shades S outside P; E (No S are P) shades the S-P intersection; I (Some S are P) places an 'X' in the intersection; and O (Some S are not P) places an 'X' in S outside P.
A three-set Venn diagram divides the universal domain into eight mutually exclusive topological regions: three single-set regions, three pairwise intersections, one central triple intersection, and the external complement.
When diagramming three-set syllogisms, universal premises (A and E) must always be shaded before diagramming particular premises (I and O) to prevent ambiguous 'X' placement.
Quantitative set logic problems are resolved using the Principle of Inclusion-Exclusion, accounting for double-counted and triple-counted overlaps across multiple operational classifications.
Last updated: October 2026
Venn Diagrams, Euler Circles, and Three-Set Quantifier Logic
When deductive arguments involve multi-tiered classifications, complex departmental overlaps, or conflicting intelligence statements, verbal logic alone can become convoluted. Visual set theory—operationalized through Euler circles and Venn diagrams —provides a rigorous, geometric technique for testing validity, mapping quantifier relationships, and solving quantitative distribution problems on the CSE-FSO Analytical Ability subtest.
Euler Circles vs. Venn Diagrams
Although frequently conflated, Euler circles and Venn diagrams operate on distinct topological principles:
Euler Circles : Illustrate only relationships that actually exist according to the given premises. If two sets are mutually disjoint ( No treaties are informal memos ), an Euler representation draws two completely separate, non-intersecting circles. If one set is entirely subsumed within another ( All ambassadors are diplomats ), it draws concentric circles.
Venn Diagrams : Draw all logically possible intersections between the sets (typically overlapping circles within a bounding rectangle representing the universe of discourse U U U ). Rather than altering circle geometry, a Venn diagram uses shading to denote that a region contains zero members (empty set, ∅ \emptyset ∅ ) and places an "X" to denote that a region contains at least one member. EULER CIRCLES (Specific Relations) VENN DIAGRAM (Universal Template)
- +---------+ +---------+ +-------------------+
- | Set A | | Set B | | /-----\ /-----\ |
- | Disjoint| | Disjoint| | / A X B \ |
- +---------+ +---------+ | ( ( ) ) |
- | \ X / |
- +---------------+ | \-----/ \-----/ |
- | Set B | | Universe (U) |
- | +---------+ | +-------------------+
- | | Set A | | (Shading indicates empty;
- | +---------+ | 'X' indicates >= 1 member)
- +---------------+
- Mapping Categorical Propositions to Two-Set Venn Diagrams
To diagram propositions involving two terms—Subject ( S S S ) and Predicate ( P P P )—within the Universal set ( U U U ):
Proposition Verbal Statement Symbolic Set Notation Graphical Representation
A All S are P S ∩ P ′ = ∅ S \cap P' = \emptyset S ∩ P ′ = ∅ Shade Region 1 ( S S S outside P P P ). The only allowable S S S members reside inside P P P .
E No S are P S ∩ P = ∅ S \cap P = \emptyset S ∩ P = ∅ Shade Region 2 (the intersection of S S S and P P P ). No entities can exist in both.
I Some S are P S ∩ P ≠ ∅ S \cap P \neq \emptyset S ∩ P = ∅ Place an 'X' in Region 2 (the intersection). Guarantees at least one member.
O Some S are not P S ∩ P ′ ≠ ∅ S \cap P' \neq \emptyset S ∩ P ′ = ∅ Place an 'X' in Region 1 ( S S S outside P P P ). Guarantees at least one non- P P P in S S S .
Note
In Venn diagram convention, shading means empty (zero elements), NOT filled with elements. An 'X' represents existence (at least one entity). An unshaded area with no mark indicates complete lack of information: entities may or may not exist there.
The Architecture of the Three-Set Venn Diagram
Standard categorical syllogisms involve three terms: Minor Term ( S S S , bottom-left circle), Major Term ( P P P , bottom-right circle), and Middle Term ( M M M , top circle). Three overlapping circles partition the universe of discourse into eight mutually exclusive regions : /-----------\
- / M \
- / Region 1 \
- / \
- / /-----\ /-----\ \
- ( / 4 X 5 \ )
- \ ( (7) ) /
- X \-----/ | \-----/ X
- / \ / \ / \
- / \ 2 / \ 3 / \
- / S \---/ \---/ P \
- / Region 6 \
- \---------------------------/
- Region 8: Outside all circles (U)
- The Eight Topological Regions
Region 1 : M M M only (exclusive to Middle term: M ∩ S ′ ∩ P ′ M \cap S' \cap P' M ∩ S ′ ∩ P ′ ).
Region 2 : S S S only (exclusive to Minor term: S ∩ M ′ ∩ P ′ S \cap M' \cap P' S ∩ M ′ ∩ P ′ ).
Region 3 : P P P only (exclusive to Major term: P ∩ S ′ ∩ M ′ P \cap S' \cap M' P ∩ S ′ ∩ M ′ ).
Region 4 : S ∩ M S \cap M S ∩ M only (intersection of Subject and Middle, excluding Predicate: S ∩ M ∩ P ′ S \cap M \cap P' S ∩ M ∩ P ′ ).
Region 5 : P ∩ M P \cap M P ∩ M only (intersection of Predicate and Middle, excluding Subject: P ∩ M ∩ S ′ P \cap M \cap S' P ∩ M ∩ S ′ ).
Region 6 : S ∩ P S \cap P S ∩ P only (intersection of Subject and Predicate, excluding Middle: S ∩ P ∩ M ′ S \cap P \cap M' S ∩ P ∩ M ′ ).
Region 7 : S ∩ P ∩ M S \cap P \cap M S ∩ P ∩ M (Central intersection: members belonging to all three classes).
Region 8 : External complement (members of U U U belonging to neither S S S , nor P P P , nor M M M ).
Systematic Protocol for Testing Three-Set Syllogisms
To test the validity of a categorical syllogism with a Venn diagram, execute this rigorous protocol:
Step 1: Label the Three Circles
Designate the bottom-left circle as the Minor Term ( S S S ), the bottom-right as the Major Term ( P P P ), and the top circle as the Middle Term ( M M M ).
Step 2: Diagram the Universal Premises First (Rule of Priority)
If the argument contains one universal premise (A or E) and one particular premise (I or O), always diagram the universal premise first . Shading an entire region eliminates it as a viable candidate for placing an 'X'.
To diagram "All M are P" : Shade every sub-region of M M M that lies outside P P P (Regions 1 and 4).
To diagram "No S are M" : Shade every sub-region where S S S and M M M overlap (Regions 4 and 7).
Step 3: Diagram the Particular Premise
After shading, place an 'X' representing the particular premise (I or O):
If the target zone consists of two sub-regions and one sub-region has already been shaded , place the 'X' squarely in the remaining unshaded sub-region.
If neither sub-region is shaded , place the 'X' directly on the boundary line dividing the two sub-regions. An 'X' on a dividing line signifies that while an element exists in the combined region, its specific sub-region location is undetermined.
Step 4: Inspect the Diagram to Verify the Conclusion
Do not draw the conclusion on the diagram! Instead, inspect the diagram to see if the conclusion was automatically established by diagramming the premises:
If the conclusion is "All S are P" , check whether the entire portion of S S S outside P P P is shaded. If not, the syllogism is invalid.
If the conclusion is "Some S are P" , check whether there is an 'X' located unambiguously inside the S-P intersection (Region 6 or Region 7). An 'X' straddling a border line does not validate the conclusion.
Quantitative Overlaps and the Principle of Inclusion-Exclusion
In addition to formal syllogisms, the CSE-FSO Analytical subtest tests mathematical set logic involving overlapping groups of personnel, budget lines, or language capabilities.
Two-Set Inclusion-Exclusion Formula ∣ A ∪ B ∣ = ∣ A ∣ + ∣ B ∣ − ∣ A ∩ B ∣ |A \cup B| = |A| + |B| - |A \cap B| ∣ A ∪ B ∣ = ∣ A ∣ + ∣ B ∣ − ∣ A ∩ B ∣
To find elements belonging to only one set : ∣ A only ∣ = ∣ A ∣ − ∣ A ∩ B ∣ |A \text{ only}| = |A| - |A \cap B| ∣ A only ∣ = ∣ A ∣ − ∣ A ∩ B ∣ .
Total population: ∣ U ∣ = ∣ A ∪ B ∣ + ∣ Neither ∣ |U| = |A \cup B| + |\text{Neither}| ∣ U ∣ = ∣ A ∪ B ∣ + ∣ Neither ∣ .
Three-Set Inclusion-Exclusion Formula ∣ A ∪ B ∪ C ∣ = ∣ A ∣ + ∣ B ∣ + ∣ C ∣ − ( ∣ A ∩ B ∣ + ∣ B ∩ C ∣ + ∣ A ∩ C ∣ ) + ∣ A ∩ B ∩ C ∣ |A \cup B \cup C| = |A| + |B| + |C| - (|A \cap B| + |B \cap C| + |A \cap C|) + |A \cap B \cap C| ∣ A ∪ B ∪ C ∣ = ∣ A ∣ + ∣ B ∣ + ∣ C ∣ − ( ∣ A ∩ B ∣ + ∣ B ∩ C ∣ + ∣ A ∩ C ∣ ) + ∣ A ∩ B ∩ C ∣ Total in at least one set = Sum of Singles - Sum of Pairwise Overlaps + Central Triple Overlap
High-Yield Derived Sub-Formulas
When administrative test items provide aggregate data and ask for specific subgroup counts, utilize these algebraic deductions:
Elements belonging to EXACTLY TWO sets : Exactly Two = ( ∣ A ∩ B ∣ + ∣ B ∩ C ∣ + ∣ A ∩ C ∣ ) − 3 ∣ A ∩ B ∩ C ∣ \text{Exactly Two} = (|A \cap B| + |B \cap C| + |A \cap C|) - 3|A \cap B \cap C| Exactly Two = ( ∣ A ∩ B ∣ + ∣ B ∩ C ∣ + ∣ A ∩ C ∣ ) − 3∣ A ∩ B ∩ C ∣
Elements belonging to AT LEAST TWO sets : At Least Two = ( ∣ A ∩ B ∣ + ∣ B ∩ C ∣ + ∣ A ∩ C ∣ ) − 2 ∣ A ∩ B ∩ C ∣ \text{At Least Two} = (|A \cap B| + |B \cap C| + |A \cap C|) - 2|A \cap B \cap C| At Least Two = ( ∣ A ∩ B ∣ + ∣ B ∩ C ∣ + ∣ A ∩ C ∣ ) − 2∣ A ∩ B ∩ C ∣
Elements belonging to EXACTLY ONE set : Exactly One = ∣ A ∪ B ∪ C ∣ − At Least Two \text{Exactly One} = |A \cup B \cup C| - \text{At Least Two} Exactly One = ∣ A ∪ B ∪ C ∣ − At Least Two
Government Intelligence and Personnel Dossier Applications
In national security assessments and multilateral diplomatic analysis, foreign service officers must reconcile conflicting intelligence claims and verify operational compliance:
Disjoint Analysis : Confirming whether sanctions compliance lists and licensed exporter registries share zero intersection.
Quantifier Boundary Tracking : Determining whether conflicting surveillance reports guarantee the presence of covert maritime vessels in an exclusive economic zone, or merely indicate indeterminate borderline activity.