: Well-Ordering Theorem; Cantor–Schröder–Bernstein Theorem; Burali-Forti Paradox. Comparison of Popular Introductory Texts
: Covers predicates, quantifiers, and formal languages, providing the necessary syntax for writing mathematical proofs. A First Course in Mathematical Logic and Set Th...
The curriculum typically follows a progression from basic logical structures to advanced foundational theorems: : Well-Ordering Theorem
by Michael L. O'Leary is a foundational textbook designed to transition students from computational mathematics to rigorous proof-writing. It presents symbolic logic not just as an abstract subject, but as the essential framework for structuring mathematical arguments. Core Course Components and formal languages