PHI-DSC-201 (Logic I): Unit 5: Preliminary Set Theory

Contact Hours: 60 | Full Marks: 100 (ESE=70/CCA=30)

Introduction to Set Theory
Basic Set Operations
Relationship to Logic

Introduction to Set Theory

Set Theory is the mathematical theory of collections of objects. In Logic, it provides a foundational language and tool for understanding classes and categorical propositions.

Core Concepts

Set: A well-defined collection of distinct objects, called elements or members.
Notation Example: A = {1, 2, 3, 4}
Universal Set (U): The set of all elements or objects under consideration in a particular context. It is the boundary or frame of reference.
Empty Set (∅ or {}): The unique set containing no elements.
Subset (⊆): Set A is a subset of Set B if every element of A is also an element of B.
Example: If A = {1, 2} and B = {1, 2, 3}, then A ⊆ B.

Definition: The statement that **x is an element of set A** is written as x ∈ A.

Basic Set Operations

Set operations combine existing sets to form new sets.

Operation	Definition	Notation (Logical Equivalent)
Union	The set containing all elements that belong to A or B (or both).	A ∪ B (Disjunction: P ∨ Q)
Intersection	The set containing all elements that belong to A and B.	A ∩ B (Conjunction: P ⋅ Q)
Complement	The set containing all elements in the Universal Set (U) that do not belong to A.	A' or Ā (Negation: ¬P)

Visual Representation: Venn Diagrams

Venn Diagrams use overlapping circles within a rectangle (the Universal Set) to visualize the relationships between sets. This is crucial for testing syllogisms (Unit 2).

Shading: Represents that a region is **empty** (it contains no members). This is the key tool for representing Universal Propositions (A and E) in the Boolean interpretation.
Placing an 'x': Represents that a region is **non-empty** (it contains at least one member). This is the key tool for representing Particular Propositions (I and O).

Relationship to Logic

Set theory provides the mathematical underpinning for the formal system of Boolean Logic. George Boole showed that logical principles could be represented and calculated using algebraic methods, with sets being the primary subject matter.

The **subject and predicate terms** of a categorical proposition (e.g., 'S' and 'P') are viewed as **classes (sets)**.
The four standard forms (A, E, I, O) are expressed by affirming or denying that the intersection of two classes is empty.

Exam Focus: Set Notation of Categorical Propositions

You must know how to translate the four standard forms into set notation (where S and P are classes):

A (All S is P): S ∩ P' = ∅ (The intersection of S and not-P is empty).
E (No S is P): S ∩ P = ∅ (The intersection of S and P is empty).
I (Some S is P): S ∩ P ≠ ∅ (The intersection of S and P is non-empty).
O (Some S is not P): S ∩ P' ≠ ∅ (The intersection of S and not-P is non-empty).

Key Takeaway for Unit 5:

Preliminary Set Theory gives meaning to the **Boolean Square of Opposition** (Unit 2) and the **Venn Diagram technique** (Unit 2). Focus on the definitions of the basic operations (Union, Intersection, Complement) and the **set notation equivalent** of the four categorical propositions (A, E, I, O).