Suppes Axiomatic Set Theory Pdf Online

Introduction Patrick Suppes (1922–2014) was a towering figure in 20th-century philosophy of science, logic, and mathematics. His 1960 book, Axiomatic Set Theory , remains one of the most accessible yet rigorous introductions to the subject. Unlike more formalist treatments (e.g., Bernays–Gödel or Morse–Kelley), Suppes strikes a balance between philosophical motivation and technical precision. For decades, his text has been widely circulated as a PDF, serving self-learners, graduate students, and philosophers.

This article explores the structure, axioms, key theorems, and enduring relevance of Suppes’ axiomatic set theory. Before Suppes, set theory had been developed naively by Cantor, Frege, and others. However, the discovery of paradoxes (Russell’s paradox, Cantor’s paradox) showed that unrestricted comprehension leads to inconsistency. The axiomatic approach—pioneered by Zermelo (1908), refined by Fraenkel and Skolem (ZFC)—restricts set formation to avoid contradictions. suppes axiomatic set theory pdf

Suppes’ goal: present a system but with a simpler, more intuitive style, suitable for beginners and philosophers. He uses a first-order language with ε (membership) and = (equality), and builds sets from the empty set upward. 2. The Language and Logical Framework Suppes assumes classical first-order logic with identity. The only non-logical primitive is the binary predicate ∈ (membership). All objects are sets—there are no ur-elements (primitive non-set objects). This is a pure set theory . For decades, his text has been widely circulated

Denoted ( \mathcalP(A) ). There exists a set containing ( \emptyset ) and closed under the successor operation ( x \cup x ). Suppes states it in terms of inductive sets. This ensures an infinite set exists (necessary for arithmetic). Axiom 7: Axiom Schema of Separation (Aussonderung) For any set A and any formula ( \phi(y) ) with no free variable for A, there exists a set ( y \in A : \phi(y) ). [ \forall A \exists B \forall y (y \in B \leftrightarrow y \in A \land \phi(y)) ] ( \bigcup A

Proof : Let ( A ) and ( B ) be sets. By Pairing, ( A, B ) is a set. By Union, ( \bigcup A, B ) is a set. But ( \bigcup A, B = A \cup B ). QED.