Download Free Introduction To The Theory Of Sets Book in PDF and EPUB Free Download. You can read online Introduction To The Theory Of Sets and write the review.

This undergraduate text develops its subject through observations of the physical world, covering finite sets, cardinal numbers, infinite cardinals, and ordinals. Includes exercises with answers. 1958 edition.
"This accessible approach to set theory for upper-level undergraduates poses rigorous but simple arguments. Each definition is accompanied by commentary that motivates and explains new concepts. A historical introduction is followed by discussions of classes and sets, functions, natural and cardinal numbers, the arithmetic of ordinal numbers, and related topics. 1971 edition with new material by the author"--
This unique approach maintains that set theory is the primary mechanism for ideological and theoretical unification in modern mathematics, and its technically informed discussion covers a variety of philosophical issues. 1990 edition.
What is a number? What is infinity? What is continuity? What is order? Answers to these fundamental questions obtained by late nineteenth-century mathematicians such as Dedekind and Cantor gave birth to set theory. This textbook presents classical set theory in an intuitive but concrete manner. To allow flexibility of topic selection in courses, the book is organized into four relatively independent parts with distinct mathematical flavors. Part I begins with the Dedekind–Peano axioms and ends with the construction of the real numbers. The core Cantor–Dedekind theory of cardinals, orders, and ordinals appears in Part II. Part III focuses on the real continuum. Finally, foundational issues and formal axioms are introduced in Part IV. Each part ends with a postscript chapter discussing topics beyond the scope of the main text, ranging from philosophical remarks to glimpses into landmark results of modern set theory such as the resolution of Lusin's problems on projective sets using determinacy of infinite games and large cardinals. Separating the metamathematical issues into an optional fourth part at the end makes this textbook suitable for students interested in any field of mathematics, not just for those planning to specialize in logic or foundations. There is enough material in the text for a year-long course at the upper-undergraduate level. For shorter one-semester or one-quarter courses, a variety of arrangements of topics are possible. The book will be a useful resource for both experts working in a relevant or adjacent area and beginners wanting to learn set theory via self-study.
A wonderful new book ... Potter has written the best philosophical introduction to set theory on the market - Timothy Bays, Notre Dame Philosophical Reviews.
Set theory is a branch of mathematics with a special subject matter, the infinite, but also a general framework for all modern mathematics, whose notions figure in every branch, pure and applied. This Element will offer a concise introduction, treating the origins of the subject, the basic notion of set, the axioms of set theory and immediate consequences, the set-theoretic reconstruction of mathematics, and the theory of the infinite, touching also on selected topics from higher set theory, controversial axioms and undecided questions, and philosophical issues raised by technical developments.
The main notions of set theory (cardinals, ordinals, transfinite induction) are fundamental to all mathematicians, not only to those who specialize in mathematical logic or set-theoretic topology. Basic set theory is generally given a brief overview in courses on analysis, algebra, or topology, even though it is sufficiently important, interesting, and simple to merit its own leisurely treatment. This book provides just that: a leisurely exposition for a diversified audience. It is suitable for a broad range of readers, from undergraduate students to professional mathematicians who want to finally find out what transfinite induction is and why it is always replaced by Zorn's Lemma. The text introduces all main subjects of ``naive'' (nonaxiomatic) set theory: functions, cardinalities, ordered and well-ordered sets, transfinite induction and its applications, ordinals, and operations on ordinals. Included are discussions and proofs of the Cantor-Bernstein Theorem, Cantor's diagonal method, Zorn's Lemma, Zermelo's Theorem, and Hamel bases. With over 150 problems, the book is a complete and accessible introduction to the subject.
This is an introductory undergraduate textbook in set theory. In mathematics these days, essentially everything is a set. Some knowledge of set theory is necessary part of the background everyone needs for further study of mathematics. It is also possible to study set theory for its own interest--it is a subject with intruiging results anout simple objects. This book starts with material that nobody can do without. There is no end to what can be learned of set theory, but here is a beginning.
This text is intended as an introduction to mathematical proofs for students. It is distilled from the lecture notes for a course focused on set theory subject matter as a means of teaching proofs. Chapter 1 contains an introduction and provides a brief summary of some background material students may be unfamiliar with. Chapters 2 and 3 introduce the basics of logic for students not yet familiar with these topics. Included is material on Boolean logic, propositions and predicates, logical operations, truth tables, tautologies and contradictions, rules of inference and logical arguments. Chapter 4 introduces mathematical proofs, including proof conventions, direct proofs, proof-by-contradiction, and proof-by-contraposition. Chapter 5 introduces the basics of naive set theory, including Venn diagrams and operations on sets. Chapter 6 introduces mathematical induction and recurrence relations. Chapter 7 introduces set-theoretic functions and covers injective, surjective, and bijective functions, as well as permutations. Chapter 8 covers the fundamental properties of the integers including primes, unique factorization, and Euclid's algorithm. Chapter 9 is an introduction to combinatorics; topics included are combinatorial proofs, binomial and multinomial coefficients, the Inclusion-Exclusion principle, and counting the number of surjective functions between finite sets. Chapter 10 introduces relations and covers equivalence relations and partial orders. Chapter 11 covers number bases, number systems, and operations. Chapter 12 covers cardinality, including basic results on countable and uncountable infinities, and introduces cardinal numbers. Chapter 13 expands on partial orders and introduces ordinal numbers. Chapter 14 examines the paradoxes of naive set theory and introduces and discusses axiomatic set theory. This chapter also includes Cantor's Paradox, Russel's Paradox, a discussion of axiomatic theories, an exposition on Zermelo‒Fraenkel Set Theory with the Axiom of Choice, and a brief explanation of Gödel's Incompleteness Theorems.