Set theory Books

Book SynopsisProofs play a central role in advanced mathematics and theoretical computer science, yet many students struggle the first time they take a course in which proofs play a significant role. This bestselling text''s third edition helps students transition from solving problems to proving theorems by teaching them the techniques needed to read and write proofs. Featuring over 150 new exercises and a new chapter on number theory, this new edition introduces students to the world of advanced mathematics through the mastery of proofs. The book begins with the basic concepts of logic and set theory to familiarize students with the language of mathematics and how it is interpreted. These concepts are used as the basis for an analysis of techniques that can be used to build up complex proofs step by step, using detailed ''scratch work'' sections to expose the machinery of proofs about numbers, sets, relations, and functions. Assuming no background beyond standard high school mathematics, this booTrade Review'Not only does this book help students learn how to prove results, it highlights why we care so much. It starts in the introduction with some simple conjectures and gathering data, quickly disproving the first but amassing support for the second. Will that pattern persist? How can these observations lead us to a proof? The book is engagingly written, and covers - in clear and great detail - many proof techniques. There is a wealth of good exercises at various levels. I've taught problem solving before (at The Ohio State University and Williams College), and this book has been a great addition to the resources I recommend to my students.' Steven J. Miller, Williams College, Massachusetts'This book is my go-to resource for students struggling with how to write mathematical proofs. Beyond its plentiful examples, Velleman clearly lays out the techniques and principles so often glossed over in other texts.' Rafael Frongillo, University of Colorado, Boulder'I've been using this book religiously for the last eight years. It builds a strong foundation in proof writing and creates the axiomatic framework for future higher-level mathematics courses. Even when teaching more advanced courses, I recommend students to read chapter 3 (Proofs) since it is, in my opinion, the best written exposition of proof writing techniques and strategies. This third edition brings a new chapter (Number Theory), which gives the instructor a few more topics to choose from when teaching a fundamental course in mathematics. I will keep using it and recommending it to everyone, professors and students alike.' Mihai Bailesteanu, Central Connecticut State University'Professor Velleman sets himself the difficult task of bridging the gap between algorithmic and proof-based mathematics. By focusing on the basic ideas, he succeeded admirably. Many similar books are available, but none are more treasured by beginning students. In the Third Edition, the constant pursuit of excellence is further reinforced.' Taje Ramsamujh, Florida International University'Proofs are central to mathematical development. They are the tools used by mathematicians to establish and communicate their results. The developing mathematician often learns what constitutes a proof and how to present it by osmosis. How to Prove It aims at changing that. It offers a systematic introduction to the development, structuring, and presentation of logical mathematical arguments, i.e. proofs. The approach is based on the language of first-order logic and supported by proof techniques in the style of natural deduction. The art of proving is exercised with naive set theory and elementary number theory throughout the book. As such, it will prove invaluable to first-year undergraduate students in mathematics and computer science.' Marcelo Fiore, University of Cambridge'Overall, this is an engagingly-written and effective book for illuminating thinking about and building a careful foundation in proof techniques. I could see it working in an introduction to proof course or a course introducing discrete mathematics topics alongside proof techniques. As a self-study guide, I could see it working as it so well engages the reader, depending on how able they are to navigate the cultural context in some examples.' Peter Rowlett, LMS Newsletter'Altogether this is an ambitious and largely very successful introduction to the writing of good proofs, laced with many good examples and exercises, and with a pleasantly informal style to make the material attractive and less daunting than the length of the book might suggest. I particularly liked the many discussions of fallacious or incomplete proofs, and the associated challenges to readers to untangle the errors in proofs and to decide for themselves whether a result is true.' Peter Giblin, University of Liverpool, The Mathematical GazetteTable of Contents1. Sentential logic; 2. Quantificational logic; 3. Proofs; 4. Relations; 5. Functions; 6. Mathematical induction; 7. Number theory; 8. Infinite sets.

Read more less

Book SynopsisThis exploration of a notorious mathematical problem is the work of the man who discovered the solution. The award-winning author employs intuitive explanations and detailed proofs in this self-contained treatment. 1966 edition. Copyright renewed 1994.

Read more less

Book SynopsisMichael Potter presents a comprehensive new philosophical introduction to set theory. Anyone wishing to work on the logical foundations of mathematics must understand set theory, which lies at its heart.Potter offers a thorough account of cardinal and ordinal arithmetic, and the various axiom candidates. He discusses in detail the project of set-theoretic reduction, which aims to interpret the rest of mathematics in terms of set theory. The key question here is how to deal with the paradoxes that bedevil set theory. Potter offers a strikingly simple version of the most widely accepted response to the paradoxes, which classifies sets by means of a hierarchy of levels.What makes the book unique is that it interweaves a careful presentation of the technical material with a penetrating philosophical critique. Potter does not merely expound the theory dogmatically but at every stage discusses in detail the reasons that can be offered for believing it to be true. Set Theory and its PhilosophTrade Reviewa wonderful new book . . . Potter has written the best philosophical introduction to set theory on the market * Timothy Bays, Notre Dame Philosophical Reviews *Table of ContentsI. SETS ; II. NUMBERS ; III. CARDINALS AND ORDINALS ; IV. FURTHER AXIOMS

Read more less

Book SynopsisThe best introductory text we have seen. Cosmos. Lucidly and gradually explains sets and relations, the natural number sequence and its generalization, extension of natural numbers to real numbers, logic, informal axiomatic mathematics, Boolean algebras, informal axiomatic set theory, several algebraic theories, and 1st-order theories. Its clarity makes this book excellent for self-study.

Read more less

Book SynopsisAn in-depth study of the concept of a consequence relation, culminating in the concept of a Lindenbaum-Tarski algebra, intended for advanced undergraduate and graduate students in mathematics and philosophy, as well as researchers in the field of mathematical and philosophical logic.Table of Contents1: Introduction 2: Preliminaries 3: Sentential Formal Languages 4: Logical Consequences 5: Matrix Consequences 6: Unital Abstract Logics 7: Equational Consequence 8: Equational L-Consequence 9: Q-Consequence 10: Decidability Bibliography Index

Read more less

Book SynopsisThe author identifies natural, real and imaginary numbers with specified physical properties and relations and challenges the myth that mathematical objects can be defined into existence.Trade Review'This book is written with obvious enthusiasm and a deep, and frequently expressed, conviction of the essential correctness of the view it seeks to promote.' Bob Hale, University of St Andrews. THES'This is what philosophy ought to be: a grand vision combined with original and careful work on the details. It is presented with lucidity and modesty and good humour, and bedazzling technicalities. An admirable book.' David Lewis, Princeton University, Australasian Journal of Philosophy'This is what philosophy ought to be: a grand vision combined with original and careful work on the details. It is presented with lucidity and modesty and good humour, and without bedazzling technicalities. An admirable book.' David Lewis, Princeton University, Australasian Journal of PhilosophyTable of ContentsPart I - Metaphysics contains chapter on: Mathematics and universals; Recurrence Part II - Mathematics contains chapters on: Natural Numbers - Pebbles and Pythagoras; Numbers as properties; Numbers as paradigms; Numbers as relations; Numbering sets Real Numbers - Approximations; Arithmetic and Geometry; Proportions; Ratios; Real Numbers Complex Numbers - Imaginary numbers; Complex proportions Sets - From universals to sets; Sets and Essences; Sets and Consistency Part III - Truth and Existence contains chapters on: The Problem - Functions and arguments; Truth and essence; The Fox paradox Wholes and Parts - Counterparts and accidents; Property-instances; Robinson's merger; States of affairs Anyhow to Something - Categories of being; The second-order Fox; Platonism and necessity.

Read more less

Book SynopsisSet theory is concerned with the foundation of mathematics. In the original formulations of set theory, there were paradoxes contained in the idea of the set of all sets. Current standard theory (Zermelo-Fraenkel) avoids these paradoxes by restricting the way sets may be formed by other sets, specifically to disallow the possibility of forming the set of all sets. In the 1930s, Quine proposed a different form of set theory in which the set of all sets - the universal set - is allowed, but other restrictions are placed on these axioms. Since then, the steady interest expressed in these non-standard set theories has been boosted by their relevance to computer science.The second edition still concentrates largely on Quine''s New Foundations, reflecting the author''s belief that this provides the richest and most mysterious of the various systems dealing with set theories with a universal set. Also included is an expanded and completely revised account of the set theories of Church-Oswald and Mitchell, with descriptions of permutation models and extensions that preserve power sets. Dr Foster here presents the reader with a useful and readable introduction for those interested in this topic, and a reference work for those already involved in this area.Trade Review...a lively introductin to the current research on NF' * Maruice Boffa, Modern Logic *Table of Contents1. Introduction ; 2. NF and related systems ; 3. Permutation models ; 4. Church-Oswald models ; 5. Open problems ; 6. Bibliography

Read more less

Book SynopsisIntermediate Logic is an ideal text for anyone who has taken a first course in logic and is progressing to further study. It examines logical theory, rather than the applications of logic, and does not assume any specific technical grounding. The author introduces and explains each concept and term, ensuring that readers have a firm foundation for study. He provides a broad, deep understanding of logic by adopting and comparing a variety of different methods and approaches.In the first section, Bostock covers such fundamental notions as truth, validity, entailment, qualification, and decision procedures. Part Two lays out a definitive introduction to four key logical tools or procedures: semantic tableaux, axiomatic proofs, natural deduction, and sequent calculi. The final section opens up new areas of existence and identity, concluding by moveing from orthodox logic to an examination of `free logic''.Intermediate Logic provides an ideal secondary course in logic for university studentTrade ReviewThis textbook covers the fundamental proof-theoretical and model-theoretical aspects of classical propositional and first-order logic. . . .The book is clearly written and ideally suited for an intermediate course on the subject, requiring just some elementary knowledge of proof theory and model theory. * Mathematical Reviews *

Read more less

Book SynopsisThis third edition, now available in paperback, is a follow up to the author''s classic Boolean-Valued Models and Independence Proofs in Set Theory,. It provides an exposition of some of the most important results in set theory obtained in the 20th century: the independence of the continuum hypothesis and the axiom of choice. Aimed at graduate students and researchers in mathematics, mathematical logic, philosophy, and computer science, the third edition has been extensively updated with expanded introductory material, new chapters, and a new appendix on category theory. It covers recent developments in the field and contains numerous exercises, along with updated and increased coverage of the background material. This new paperback edition includes additional corrections and, for the first time, will make this landmark text accessible to students in logic and set theory.Trade ReviewBell's presentation is lively and pleasent to read, and the material is given in a nicely cohesive way. * Philosophia Mathmatica *Table of ContentsFORWARD BY DANA SCOTT; PREFACE; LIST OF PROBLEMS; APPENDIX: BOOLEAN AND HEYTING ALGEBRA-VALUED MODELS AS CATEGORIES; HISTORICAL NOTES; BIBLIOGRAPHY; INDEX OF SYMBOLS; INDEX OF TERMS

Read more less

Book SynopsisMathematics depends on proofs, and proofs must begin somewhere, from some fundamental assumptions. The axioms of set theory have long played this role, so the question of how they are properly judged is of central importance. Maddy discusses the appropriate methods for such evaluations and the philosophical backdrop that makes them appropriate.Trade Review'an engaging contribution to an important philosophical debate [which] deserves to be read far beyond the ranks of philosophers of mathematics' * Journal of Philosophy *Table of ContentsIntroduction ; 1. The Problem ; 2. Proper Method ; 3. Thin Realism ; 4. Arealism ; 5. Morals ; Bibliography

Read more less

Book SynopsisIrrationality and Transcendence in Number Theory tells the story of irrational numbers from their discovery in the days of Pythagoras to the ideas behind the work of Baker and Mahler on transcendence in the 20th century. It focuses on themes of irrationality, algebraic and transcendental numbers, continued fractions, approximation of real numbers by rationals, and relations between automata and transcendence. This book serves as a guide and introduction to number theory for advanced undergraduates and early postgraduates. Readers are led through the developments in number theory from ancient to modern times. The book includes a wide range of exercises, from routine problems to surprising and thought-provoking extension material.Features Uses techniques from widely diverse areas of mathematics, including number theory, calculus, set theory, complex analysis, linear algebra, and the theory of computation Suitable as a primary textbook forTrade Review"Exceptionally informative, impressively organized and presented, Irrationality and Transcendence in Number Theory is an ideal selection as a curriculum textbook."- Midwest Books Review"This excellent book not only helps fill a substantial gap in the undergraduate mathematics literature, but it does so in a way that most students will, I think, find interesting, inviting and accessible. [. . .] This material is, of course, very nontrivial, but Angell goes to great lengths to make it accessible. He writes slowly and clearly and spends a lot of time motivating results. As previously noted, he also includes background Appendices in each chapter.There are other useful pedagogical features. Each chapter ends with an extensive collection of exercises, most of them non-routine; a 20-page section at the end of the book offers hints to these. The book also contains a five-page bibliography (one that, surprisingly, omits the Burger/Tubbs book mentioned earlier) that directs a reader to useful sources. The subject matter of this book is interesting and beautiful and deserves to be made accessible to well-prepared senior undergraduates. Angell has done an excellent job in helping to do so."- MAA Reviews Table of Contents1. Introduction. 1.1. Irrational Surds. 1.2. Irrational Decimals. 1.3. Irrationality of the Exponential Constant. 1.4. Other Results, and Some Open Questions. Exercises. Appendix: Some Elementary Number Theory. 2. Hermite’s Method. 2.1. Irrationality of er. 2.2. Irrationality of π. 2.3. Irrational values of trigonometric functions. Exercises. Appendix: Some Results of Elementary Calculus. 3. Algebraic & Transcendental Numbers. 3.1. Definitions and Basic Properties. 3.2. Existence of Transcendental Numbers. 3.3. Approximation of Real Numbers by Rationals. 3.4. Irrationality of (3) : a sketch. Exercises. Appendix 1: Countable and Uncountable Sets. Appendix 2: The Mean Value Theorem. Appendix 3: The Prime Number Theorem. 4. Continued Fractions. Definition and Basic Properties. 4.2. Continued Fractions of Irrational Numbers. 4.3. Approximation Properties of Convergents. 4.4. Two important Approximation Problems. 4.5. A "Computational" Test for Rationality. 4.6. Further Approximation Properties of Convergents. 4.7. Computing the Continued Fraction of an Algebraic Irrational. 4.8. The Continued Fraction of e. Exercises. Appendix 1: A Property of Positive Fractions. Appendix 2: Simultaneous Equations with Integral Coefficients. Appendix 3: Cardinality of Sets of Sequences. Appendix 4: Basic Musical Terminology. 5. Hermite’s Method for Transcendence. 5.1. Transcendence of e. 5.2. Transcendence of π. 5.3. Some more Irrationality Proofs. 5.4. Transcendence of ea .5.5. Other Results. Exercises. Appendix 1: Roots and Coefficients of Polynomials. Appendix 2: Some Real and Complex Analysis. Appendix 3: Ordering Complex Numbers. 6. Automata and Transcendence. 6.1. Deterministic Finite Automata. 6.2 Mahler’s Transcendence Proof. 6.3 A More General Transcendence Result. 6.4. A Transcendence Proof for the Thue Sequence. 6.5. Automata and Functional Equations. 6.6. Conclusion. Exercises. Appendix 1: Alphabets, Languages and DFAs. Appendix 2: Some Results of Complex Analysis. Appendix 3: A Result on Linear Equations. 7. Lambert’s Irrationality Proofs. 7.1. Generalised Continued Fractions. 7.2. Further Continued Fractions. Exercises. Appendix: Some Results from Elementary Algebra and Calculus. Hints for Exercises. Bibliography. Index.

Read more less

Book SynopsisDesigned for undergraduate students of set theory, this book presents a modern perspective of the classic work of Georg Cantor and Richard Dedekin and their immediate successors. It aims to give students a grounding to the results of set theory as well as to tackle significant problems that arise from the theory.Table of ContentsINTRODUCTIONOutline of the bookAssumed knowledgeTHE REAL NUMBERSIntroductionDedekind's constructionAlternative constructionsThe rational numbersTHE NATURAL NUMBERSIntroductionThe construction of the natural numbersArithmeticFinite setsTHE ZERMELO-FRAENKEL AXIOMSIntroductionA formal languageAxioms 1 to 3Axioms 4 to 6Axioms 7 to 9CARDINAL (Without the Axiom of Choice)IntroductionComparing SizesBasic properties of ˜ and =Infinite sets without AC-countable setsUncountable sets and cardinal arithmetic without ACORDERED SETSIntroductionLinearly ordered setsOrder arithmeticWell-ordered setsORDINAL NUMBERSIntroductionOrdinal numbersBeginning ordinal arithmeticOrdinal arithmeticThe ÀsSET THEORY WITH THE AXIOM OF CHOICEIntroductionThe well-ordering principleCardinal arithmetic and the axiom of choiceThe continuum hypothesisBIBLIOGRAPHYINDEX

Read more less

Book SynopsisThere are many situations in science and engineering where complex output data from a given system is used to formulate a model of how that system operates, or to simulate its response to different inputs. Applications include control, decision theory, and the emerging fields of bioinformatics.Trade Review"To cope with real world uncertainties and provide a philosophical and practical guide...several methodologies are presented..." (SciTech Book News, Vol. 25, No. 4, December 2001) "...certainly a book that should be in the library of any institution where research and advanced study in fuzzy systems are carried out." (Choice, Vol. 39, No. 7, March 2002) "...well organized, easy to read, and self-contained.... I would recommend it to anyone interested in self-study of the basic ideas of fuzzy systems..." (International Journal of General Systems, Vol. 31, No. 6, 2002)Table of ContentsPreface. Acknowledgments. Introduction. System Analysis. Uncertainty Techniques. Learning from Data: System Identification. Propositions as Subsets of the Data Space. Fuzzy Systems and Identification. Random-Set Modelling and Identification. Certain Uncertainty. Fuzzy Inference Engines. Fuzzy Classification. Fuzzy Control. Fuzzy Mathematics. Summary. Appendices. Index.

Read more less

Book SynopsisFuzzy clustering, which combines fuzzy logic and cluster analysis techniques, has experienced a spur of interest in recent years owing to its important applications in image recognition. This revised, updated, and expanded translation of the German book deals with the ideas and algorithms of fuzzy clustering and their applications.Table of ContentsIntroduction. Basic Concepts. Classical Fuzzy Clustering Algorithms. Linear and Ellipsoidal Prototypes Shell Prototypes. Polygonal Object Boundaries. Cluster Estimation Models. Cluster Validity. Rule Generation with Clustering. Appendix. Bibliography.

Read more less

Book SynopsisIn this book, first published in 2003, categorical algebra is used to build a foundation for the study of geometry, analysis, and algebra. Starting with intuitive descriptions of mathematically and physically common phenomena, it leads up to a precise specification of the Category of Sets. Suitable for advanced undergraduates and beginning graduate students.Trade Review"...the categorical approach to mathematics has never been presented with greater conviction than it has in this book. The authors show that the use of categories in analyzing the set concept is not only natural, but inevitable." Mathematical Reviews"To learn set theory this way means not having to relearn it later.... Recommended." ChoiceTable of ContentsForeword; 1. Abstract sets and mappings; 2. Sums, monomorphisms and parts; 3. Finite inverse limits; 4. Colimits, epimorphisms and the axiom of choice; 5. Mapping sets and exponentials; 6. Summary of the axioms and an example of variable sets; 7. Consequences and uses of exponentials; 8. More on power sets; 9. Introduction to variable sets; 10. Models of additional variation; Appendices; Bibliography.

Read more less

Book SynopsisThis new edition of Introduction to Lattices and Order presents a radical reorganization and updating, though its primary aim is unchanged. The explosive development of theoretical computer science in recent years has, in particular, influenced the book's evolution: a fresh treatment of fixpoints testifies to this and Galois connections now feature prominently. An early presentation of concept analysis gives both a concrete foundation for the subsequent theory of complete lattices and a glimpse of a methodology for data analysis that is of commercial value in social science. Classroom experience has led to numerous pedagogical improvements and many new exercises have been added. As before, exposure to elementary abstract algebra and the notation of set theory are the only prerequisites, making the book suitable for advanced undergraduates and beginning graduate students. It will also be a valuable resource for anyone who meets ordered structures.Trade Review'Recommended for every academic mathematics collection.' Choice'… an excellent introductory textbook on ordered sets and lattices and it is intended for undergraduate and beginning graduate students in mathematics.' Vaclav Slavic, Zentralblatt für Mathematik'I used Introduction to Lattices and Order as the sole textbook in a one semester course. The students enrolled were a heterogeneous group including modestly prepared undergraduates, well trained graduate students, and a few applications-oriented computer science students … In short, the textbook was a success.' Joel Berman, Australian Mathematical Society Gazette'… a well-written, satisfying, informative, and stimulating account of applications that are of great interest, particularly in computer science and social science … it will surely become a classic.' Mathematical Reviews'Altogether, this is a great book. It would be interesting (and educational) to give a course based on it - almost makes me wish I hadn't retired!' Australian Mathematical Society Gazette'… a valuable source to anyone who needs to use ordered structures in any context.' EMS Newsletter'It can be recommended as a valuable source to anyone who needs to use ordered structures in any context.' European Mathematical Society'The book is written in a very engaging and fluid style. The understanding of the content is aided tremendously by the very large number of beautiful lattice diagrams … The book provides a wonderful and accessible introduction to lattice theory, of equal interest to both computer scientists and mathematicians.' Jonathan Cohen, SIGACT NewsTable of ContentsPreface; Preface to the first edition; 1. Ordered sets; 2. Lattices and complete lattices; 3. Formal concept analysis; 4. Modular, distributive and Boolean lattices; 5. Representation theory: the finite case; 6. Congruences; 7. Complete lattices and Galois connections; 8. CPOs and fixpoint theorems; 9. Domains and information systems; 10. Maximality principles; 11. Representation: the general case; Appendix A. A topological toolkit; Appendix B. Further reading; Notation index; Index.

Read more less

Book SynopsisProvides an introduction to algebraic cycles on complex algebraic varieties, to the major conjectures relating them to cohomology, and even more precisely to Hodge structures on cohomology. This title delves into arguments originating in Nori's work that have been further developed by others.Trade Review"This dense, fascinating book by Voisin is a report of some of the exciting discoveries she has made in the quest of the secrets of algebraic cycles."--Alberto Collino, Zentralblatt MATH "[An advanced] reader will find a rich collection of ideas as well as detailed machinery with which to attack difficult problems in the field. Any complex geometer interested in the interplay between algebraic cycles, Hodge theory and algebraic topology should have this book on his or her shelf."--C. A. M. Peters, Mathematical Reviews ClippingsTable of ContentsPreface vii 1Introduction 1 1.1 Decomposition of the diagonal and spread 3 1.2 The generalized Bloch conjecture 7 1.3 Decomposition of the small diagonal and application to the topology of families 9 1.4 Integral coefficients and birational invariants 11 1.5 Organization of the text 13 2Review of Hodge theory and algebraic cycles 15 2.1 Chow groups 15 2.2 Hodge structures 24 3Decomposition of the diagonal 36 3.1 A general principle 36 3.2 Varieties with small Chow groups 44 4Chow groups of large coniveau complete intersections 55 4.1 Hodge coniveau of complete intersections 55 4.2 Coniveau 2 complete intersections 64 4.3 Equivalence of generalized Bloch and Hodge conjectures for general complete intersections 67 4.4 Further applications to the Bloch conjecture on 0-cycles on surfaces 86 5On the Chow ring of K3 surfaces and hyper-Kahler manifolds 88 5.1 Tautological ring of a K3 surface 88 5.2 A decomposition of the small diagonal 96 5.3 Deligne's decomposition theorem for families of K3 surfaces 106 6Integral coefficients 123 6.1 Integral Hodge classes and birational invariants 123 6.2 Rationally connected varieties and the rationality problem 127 6.3 Integral decomposition of the diagonal and the structure of the Abel-Jacobi map 139 Bibliography 155 Index 163

Read more less

Book SynopsisHave you ever played the addictive card game SET? Have you ever wondered about the connections between games and mathematics? If the answer to either question is yes, then The Joy of SET is the book for you! The Joy of SET takes readers on a fascinating journey into this seemingly simple card game and reveals its surprisingly deep and diverse matTrade Review"[A] model of mathematical exposition. The quality of writing is consistently high: clear but not condescending, humorous, chatty, and a genuine pleasure to read... I doubt it will be very long before I find something from [The Joy of SET] to use in one of my classes."--Mark Hunacek, MAA Reviews "[The Joy of SET] shows how budding interest in mathematics can be fostered and developed... If [middle and high school teachers] ever try to enliven their classes or just interaction with curious students, this book is one they may depend on."--Alexander Bogomolny, Cut the Knot blog "[A]mazing... What I love about The Joy of SET is that it is written in such a way that it can be read and enjoyed by both SET enthusiasts and someone that has never played SET before... Really and truly, there is enough math in this book to keep you busy for a lifetime! ... I definitely recommend this book."--Sarah Carter, Math Equals Love blog "[The Joy of SET] takes readers on a fascinating journey into this seemingly simple card game... The book is in my view just the right way to talk about math as fun, and intellectually challenging."--Robert Harington, Scholarly Kitchen "[A]s the authors convincingly demonstrate ... the mathematics behind SET actually goes very deep... [The Joy of SET] would make a fantastic resource for a middle school, high school, or undergraduate math club."--Brent Yorgey, Math Less Traveled blog "This book, written by a mathematically inclined family, is the first and only work to explore the connection between the game and mathematics... [The Joy of SET] will attract those who play SET and those who want to explore mathematically related subjects."--ChoiceTable of ContentsPreface vii 1 SET and You 1 2 Counting Fun! 27 3 Probability! 52 4 SET and Modular Arithmetic 72 5 SET and Geometry 98 Interlude: How to Improve at SET 136 6 More Combinatorics 149 7 Probability and Statistics 171 8 Vectors and Linear Algebra 197 9 Affine Geometry Plus 229 10 Computing and Simulations 256 Conclusion 288 Solutions to Exercises 289 Bibliography 303 Index 307

Read more less

Book SynopsisTrade Review“A model of mathematical exposition. The quality of writing is consistently high: clear but not condescending, humorous, chatty, and a genuine pleasure to read.”—Mark Hunacek, MAA Reviews“The book shows how budding interest in mathematics can be fostered and developed.”—Alexander Bogomolny, Cut the Knot“What I love about The Joy of SET is that it is written in such a way that it can be read and enjoyed by both SET enthusiasts and someone that has never played SET before.”—Sarah Carter, Math Equals Love“As the authors convincingly demonstrate . . . the mathematics behind SET actually goes very deep."—Brent Yorgey, Math Less Traveled“The Joy of SET uses a popular and very simple card game as a springboard for a whirlwind tour through probability, combinatorics, finite geometries, and experimental mathematics. Whether or not you play SET, you’ll find a lot of great math to play with in this book.”—Jordan Ellenberg, author of How Not to Be Wrong: The Power of Mathematical Thinking

Read more less

Book SynopsisThoroughly revised, updated, expanded, and reorganized to serve as a primary text for mathematics courses, Introduction to Set Theory, Third Edition covers the basics: relations, functions, orderings, finite, countable, and uncountable sets, and cardinal and ordinal numbers. It also provides five additional self-contained chapters, consolidates the material on real numbers into a single updated chapter affording flexibility in course design, supplies end-of-section problems, with hints, of varying degrees of difficulty, includes new material on normal forms and Goodstein sequences, and adds important recent ideas including filters, ultrafilters, closed unbounded and stationary sets, and partitions.Trade Review"The book remains an excellent text for a senior undergraduate or first-year graduate level course. There is sufficient material for instructors of widely differing views to assemble one-semester courses. . ..the chapter on the axiom of choice is particularly strong. "---Mathematical Reviews ". . .a fine text. . ..The proofs are both elegant and readable. "---American Mathematical Monthly ". . .offers many benefits including. . .interesting applications of abstract set theory to real analysis. . .enriching standard classroom material. "---L'Enseignement mathematique ". . .an excellent and much needed book. . .Especially valuable are a number of remarks sprinkled throughout the text which afford a glimpse of further developments. "---The Mathematical Intelligencer "The authors show that set theory is powerful enough to serve as an underlying framework for mathematics by using it to develop the beginnings of the theory of natural, rational, and real numbers. "---Quarterly Review of Applied Mathematics ". . .In the third edition, Chapter 11 has been expanded, and four new chapters have been added. "---Mathematical ReviewsTable of ContentsSets; relations, functions and orderings; natural numbers; finite, countable and uncountable sets; cardinal numbers; ordinal numbers; alephs; the axiom of choice; arithmetic of cardinal numbers; sets of real numbers; filters and ultrafilters; combinatorial set theory; large cardinals; the axiom of foundation; the axiomatic set theory.

Read more less

Book SynopsisThis Element addresses the categoricity arguments that have been more effective in historical cases that reflect philosophically on internal mathematical matters than in recent questions of pre-theoretic metaphysics.Table of Contents1. Introduction; 2. Dedekind in 'Was sind und was sollen die Zahlen?' (1888); 3. Dedekind in 'Was sind und was sollen die Zahlen?' (1888); 4. Kreisel in 'Informal rigor and incompleteness proofs' (1967) and 'Two notes on the foundations of set theory'(1969); 5. Parsons in 'The uniqueness of the natural numbers' (1990) and 'Mathematical induction' (2008); 6. Parsons in 'The uniqueness of the natural numbers' (1990) and 'Mathematical induction' (2008); 7. Conclusion; References.

Read more less

Book SynopsisThe Language of Symmetry is a re-assessment of the structure and reach of symmetry, by an interdisciplinary group of specialists from the arts, humanities, and sciences at Oxford University.It explores, amongst other topics: order and chaos in the formation of planetary systems entropy and symmetry in physics group theory, fractals, and self-similarity symmetrical structures in western classical music how biological systems harness disorder to create order This book aims to open up the scope of interdisciplinary work in the study of symmetry and is intended for scholars of any background - whether it be science, arts, or philosophy.Table of Contents1. Planetary Systems: From Symmetry to Chaos. 2. Entropy and Symmetry in the Universe. 3. Darkness, Light, and how Symmetry might relate Them. Self-Similar 4. Self-Similarity. 5 The Language of Symmetry in Music. 6. The Interdependence of Order and Disorder: How Complexity arises in the Living and the Inanimate Universe. 7. A Philosophers Perspective on the Harnessing of Stochasticity. 8. Postscript: A Dialogue between Denis Noble and Benedict Rattigan. 9. Appendix: A Response to Professor Nobles Paper: Ordered disorder to drive Physiology.

Read more less

The Baseball Mysteries: Challenging Puzzles for Logical Detectives is a book of baseball puzzles, logical baseball puzzles. To jump in, all you need is logic and a casual fan's knowledge of the game. The puzzles are solved by reasoning from the rules of the game and a few facts.The logic in the puzzles is like legal reasoning. A solution must argue from evidence (the facts) and law (the rules). Unlike legal arguments, however, a solution must reach an unassailable conclusion.There are many puzzle books. But there's nothing remotely like this book. The puzzles here, while rigorously deductive, are firmly attached to actual events, to struggles that are reported in the papers every day.The puzzles offer a unique and scintillating connection between abstract logic and gritty reality.Actually, this book offers the reader an unlimited number of puzzles. Once you've solved a few of the challenges here, every boxscore you see in the pap

Read more less

Book SynopsisThis book introduces readers to the art of doing mathematical proofs. Proofs are the glue that holds mathematics together. They make connections between math concepts and show why things work the way they do. This book teaches the art of proofs using familiar high-school concepts, such as numbers, polynomials, functions, and trigonometry. It retells math as a story, where the next chapter follows from the previous one.Readers will see how various mathematical concepts are tied and will see that mathematics is not a pile of formulas and facts; rather, it has an orderly and beautiful edifice.The author begins with basic rules of logic and then progresses through the topics already familiar to the students: numbers, inequalities, functions, polynomials, exponents, and trigonometric functions. There are also beautiful proofs for conic sections, sequences, and Fibonacci numbers. Each chapter has exercises for the reader.Reviewer Comments:I find the

Read more less

Book SynopsisA Beginnerâs Guide to Mathematical Proof prepares mathematics majors for the transition to abstract mathematics, as well as introducing a wider readership of quantitative science students, such as engineers, to the mathematical structures underlying more applied topics.The text is designed to be easily utilized by both instructor and student, with an accessible, step-by-step approach requiring minimal mathematical prerequisites. The book builds towards more complex ideas as it progresses, but never makes assumptions of the reader beyond the material already covered.Features No mathematical prerequisites beyond high school mathematics Suitable for an Introduction to Proofs course for mathematics majors and other students of quantitative sciences, such as engineering Replete with exercises and examples.

Read more less

Book SynopsisContemporary students of mathematics differ considerably from those of half a century ago. In spite of this, many textbooks written and now considered to be âœclassicsâ decades ago are still prescribed for students today. These texts are not suitable for todayâs students. This text is meant for and written to todayâs mathematics students. Set theory is a pure mathematics endeavour in the sense that it seems to have no immediate applications; yet the knowledge and skills developed in such a course can easily branch out to various fields of both pure mathematics and applied mathematics.Rather than transforming the reader into a practicing mathematician this book is more designed to initiate the reader to what may be called âœmathematical thinkingâ while developing knowledge about foundations of modern mathematics. Without this insight, becoming a practicing mathematician is much more daunting.The main objective is twofold. The students will develop some fun

Read more less

Book SynopsisDiscrete Mathematics: An Open Introduction, Fourth Edition aims to provide an introduction to select topics in discrete mathematics at a level appropriate for first or second year undergraduate math and computer science majors, especially those who intend to teach middle and high school mathematics. The book began as a set of notes for the Discrete Mathematics course at the University of Northern Colorado. This course serves both as a survey of the topics in discrete math and as the âœbridgeâ course for math majors. Features Uses problem-oriented and inquiry-based methods to teach the concepts. Suitable for undergraduates in mathematics and computer science. New to the 4th edition Large scale restructuring. Contains more than 750 exercises and examples. New sections on probability, relations, and discrete structures and their proofs.

Read more less

Book SynopsisAssuming little mathematical background, this short introduction to category theory is ideal for beginning graduate students or advanced undergraduates learning category theory for the first time. Suitable for independent study or as a course book, it gives extensive explanations of the key concepts along with hundreds of examples and exercises.Table of ContentsNote to the reader; Introduction; 1. Categories, functors and natural transformations; 2. Adjoints; 3. Interlude on sets; 4. Representables; 5. Limits; 6. Adjoints, representables and limits; Appendix: proof of the General Adjoint Functor Theorem; Glossary of notation; Further reading; Index.

Read more less

Book SynopsisSet theory is a rich and beautiful subject whose fundamental concepts permeate virtually every branch of mathematics. One could say that set theory is a unifying theory for mathematics, since nearly all mathematical concepts and results can be formalized within set theory. This textbook is meant for an upper undergraduate course in set theory. In this text, the fundamentals of abstract sets, including relations, functions, the natural numbers, order, cardinality, transfinite recursion, the axiom of choice, ordinal numbers, and cardinal numbers, are developed within the framework of axiomatic set theory. The reader will need to be comfortable reading and writing mathematical proofs. The proofs in this textbook are rigorous, clear, and complete, while remaining accessible to undergraduates who are new to upper-level mathematics. Exercises are included at the end of each section in a chapter, with useful suggestions for the more challenging exercises.Trade Review'… Cunningham neglects no opportunity to make the subject as accessible as possible. The mathematical development is rigorous, as it should be, but not excessively so. Although he starts from zero, that is not to say the book is easy, but any difficulty that arises is in the nature of the subject, and is no fault of the author's. Throughout the book, he offers many appropriate examples (or non-examples), and provides numerous and diverse exercises, which often prove results that are later used in the body of the text, drawing the reader into the subject.' Frederic Green, ACM SIGACT News'This book fulfills its stated goals: 'The textbook is suitable for a broad range of readers, from undergraduate to graduate students, who desire a better understanding of the fundamental topics in set theory that may have been, or will be, overlooked in their other mathematics courses'.' Shoshana Friedman, MathSciNetTable of Contents1. Introduction; 2. Basic set building axioms and operations; 3. Relations and functions; 4. The natural numbers; 5. On the size of sets; 6. Transfinite recursion; 7. The axiom of choice (revisited); 8. Ordinals; 9. Cardinals.

Read more less

Book SynopsisThe BanachTarski Paradox is the most surprising result in mathematics. This new edition of a classic book offers a comprehensive, accessible presentation, with many related results, especially connections to non-Euclidean geometry, to squaring the circle, and even to some art by Escher. This material is suited to projects for undergraduates or masters students.Trade Review'The new edition of The Banach–Tarski Paradox, by Grzegorz Tomkowicz and Stan Wagon, is a welcome revisiting and extensive reworking of the first edition of the book. Whether you are new to the topic of paradoxical decompositions, or have studied the phenomenon for years, this book has a lot to offer. I recommend buying two copies of the book, one for the office and one for the home, because studying the book carefully (perhaps in a series of working seminars) will be worthwhile, and casually browsing through the book in your spare time will be simply a lot of fun.' Joseph Rosenblatt, Department Chair, Department of Mathematical Sciences, Indiana University-Purdue University Indianapolis'This is the second edition of this classic and comprehensive monograph on paradoxical decompositions. What adds to the special appeal of this topic is the diversity of methods and the connection to several fields including set theory, group theory, measure theory, geometry, algebra, and discrete mathematics. The previous edition of this book stimulated a large amount of research. The present volume also includes these developments and furthermore discusses the solutions to some of the problems that were solved in the past thirty years, including the realization of the Banach–Tarski paradox with pieces having the Baire property and Tarski's circle squaring problem.' Miklos Laczkovich, University College London'Wagon's classic book on the Banach–Tarski paradox has been updated with Tomkowicz to include major advances over the last thirty years. It remains the definitive source for both newcomers to the subject and experts who want to broaden their knowledge. The book provides a basic introduction to the field with clear exposition and important historical background. It includes complete proofs of the Banach–Tarski paradox and related results. It continues with an extensive survey of more advanced topics. This is far and away the best resource for beginners and experts on the strangest result in all of mathematics.' Matthew Foreman, University of California, Irvine'Several spectacular results have been proved since the first edition of this book … All these results and problems are presented in a penetrating and lucid way in this new edition.' Jan Mycielski, University of Colorado, Boulder, from the ForewordReview of previous edition: '… a readable and stimulating book.' Ward Henson, American Scientist'In 1985 Stan Wagon wrote The Banach-Tarski Paradox, which not only became the classic text on paradoxical mathematics, but also provided vast new areas for research. The new second edition, co-written with Grzegorz Tomkowicz, a Polish mathematician who specializes in paradoxical decompositions, exceeds any possible expectation I might have had for expanding a book I already deeply treasured. The meticulous research of the original volume is still there, but much new research has also been included … I should also mention that this book is beautifully illustrated.' John J. Watkins, MAA Reviews'For some people the book will be over by page 36, because by then one has seen full treatments of the results of Hausdorff and of Banach and Tarski. These people are short-sighted; there is much fascinating mathematics to be learned from the further developments. As the recent result of Marks and Unger shows, there is probably still much to discover. Indeed, the book contains some very interesting questions that still await solution.' Klaas Pieter Hart, Mathematical ReviewsTable of ContentsPart I. Paradoxical Decompositions, or the Nonexistence of Finitely Additive Measures: 1. Introduction; 2. The Hausdorff paradox; 3. The Banach–Tarski paradox: duplicating spheres and balls; 4. Hyperbolic paradoxes; 5. Locally commutative actions: minimizing the number of pieces in a paradoxical decomposition; 6. Higher dimensions; 7. Free groups of large rank: getting a continuum of spheres from one; 8. Paradoxes in low dimensions; 9. Squaring the circle; 10. The semigroup of equidecomposability types; Part II: Finitely Additive Measures, or the Nonexistence of Paradoxical Decompositions: 11. Transition; 12. Measures in groups; 13. Applications of amenability; 14. Growth conditions in groups and supramenability; 15. The role of the axiom of choice.

Read more less

Book Synopsis

Read more less

Book SynopsisStarting with the most basic notions, Universal Algebra: Fundamentals and Selected Topics introduces all the key elements needed to read and understand current research in this field. Based on the author's two-semester course, the text prepares students for research work by providing a solid grounding in the fundamental constructions and concepts of universal algebra and by introducing a variety of recent research topics.The first part of the book focuses on core components, including subalgebras, congruences, lattices, direct and subdirect products, isomorphism theorems, a clone of operations, terms, free algebras, Birkhoff's theorem, and standard Maltsev conditions. The second part covers topics that demonstrate the power and breadth of the subject. The author discusses the consequences of Jónsson's lemma, finitely and nonfinitely based algebras, definable principal congruences, and the work of Foster and Pixley on primal and quasiprimal algebras. HeTrade Review… as far as I am concerned, the book under review, by Clifford Bergman, is most welcome: we need more of this sort of thing, both for potential universal algebraists and for people like me: fellow travelers to some degree, or mathematicians who both use and thoroughly adore algebra and its structural qualities, and find themselves growing more appreciative of this architectural elegance as they evolve in their work and studies. … it is clearly written and pleasant to read … the author provides motivation as well as examples and exercises galore. At first glance it looks to me like the exercises are well-structured and should do the job of bringing the student or reader along at a decent pace from ignorance to both an appreciation for the subject and some facility with it. It’s definitely an area worth pursuing for a graduate student with the right disposition.—Michael Berg, MAA Reviews, December 2011… excellently written and is highly recommended to all who are interested in universal algebra.—Mathematical ReviewsTable of ContentsFUNDAMENTALS OF UNIVERSAL ALGEBRA: Algebras. Lattices. The Nuts and Bolts of Universal Algebra. Clones, Terms, and Equational Classes. SELECTED TOPICS: Congruence Distributive Varieties. Arithmetical Varieties. Maltsev Varieties. Finite Algebras and Locally Finite Varieties. Bibliography. Index.

Read more less

Book SynopsisInformation granules, as encountered in natural language, are implicit in nature. To make them fully operational so they can be effectively used to analyze and design intelligent systems, information granules need to be made explicit. An emerging discipline, granular computing focuses on formalizing information granules and unifying them to create a coherent methodological and developmental environment for intelligent system design and analysis. Granular Computing: Analysis and Design of Intelligent Systems presents the unified principles of granular computing along with its comprehensive algorithmic framework and design practices. Introduces the concepts of information granules, information granularity, and granular computing Presents the key formalisms of information granules Builds on the concepts of information granules with discussion of higher-order and higher-type information granules Discusses the operational concept of inTrade Review"Dr. Pedrycz is an internationally acclaimed authority in the granular computing area. ... I particularly appreciate his elegant writing style. This book is the first comprehensive treatise of the granular computing techniques and their application to the design of intelligent systems. ... As an application-oriented practitioner in computational intelligence systems, I think that this book will be a welcome and strongly needed addition to this field. I cannot think of any other expert worldwide more qualified than Prof. Pedycz to write such a book."—Emil M. Petriu, University of Ottawa, Canada "This volume covers most of the interesting and important topics in granular computing. The contents may be well understood by senior or master course students in the field of computer science ... also a good textbook for engineers who are involved in developing so-called intelligent systems."—Kaoru Hirota, Tokyo Institute of Technology, Japan "Dr. Pedrycz’s latest magnum opus ... breaks new ground in many directions. [It] takes an important step toward achievement of human-level machine intelligence—a principal goal of artificial intelligence (AI) since its inception. ... [This is] a remarkably well put together and reader-friendly collection of concepts and techniques, which constitute granular computing. ... [The book] combines extraordinary breadth with extraordinary depth. It contains a wealth of new ideas, and unfolds a vast panorama of concepts, methods, and applications. ... Dr. Pedrycz’s development and description of these concepts, techniques, and their applications is a truly remarkable achievement. ... must reading for all who are concerned with the design and application of intelligent systems."—From the Foreword by Lotfi A. Zadeh, University of California, Berkeley, USA Table of ContentsInformation Granularity, Information Granules, and Granular Computing. Key Formalisms for Representation of Information Granules and Processing Mechanisms. Information Granules of Higher Type and Higher Order, and Hybrid Information Granules. Representation of Information Granules. The Design of Information Granules. Optimal Allocation of Information Granularity: Building Granular Mappings. Granular Description of Data and Pattern Classification. Granular Models: Architectures and Development. Granular Time Series. From Models to Granular Models. Collaborative and Linguistic Models of Decision Making. Index.

Read more less

Book SynopsisSet Theoretical Aspects of Real Analysis is built around a number of questions in real analysis and classical measure theory, which are of a set theoretic flavor. Accessible to graduate students, and researchers the beginning of the book presents introductory topics on real analysis and Lebesgue measure theory. These topics highlight the boundary between fundamental concepts of measurability and nonmeasurability for point sets and functions. The remainder of the book deals with more specialized material on set theoretical real analysis. The book focuses on certain logical and set theoretical aspects of real analysis. It is expected that the first eleven chapters can be used in a course on Lebesque measure theory that highlights the fundamental concepts of measurability and non-measurability for point sets and functions. Provided in the book are problems of varying difficulty that range from simple observations to advanced results. Relatively difficult Table of ContentsZF theory and some point sets on the real line. Countable versions of AC and real analysis. Uncountable versions of AC and Lebesgue nonmeasurable sets. The Continuum Hypothesis and Lebesgue nonmeasurable sets. Measurability properties of sets and functions. Radon measures and nonmeasurable sets. Real-valued step functions with strange measurability properties. Relationships between certain classical constructions of Lebesgue nonmeasurable sets. Measurability properties of Vitali sets. A relationship between the measurability and continuity of real-valued functions. A relationship between absolutely nonmeasurable functions and Sierpinski-Zygmund functions. Sums of absolutely nonmeasurable injective functions. A large group of absolutely nonmeasurable additive functions. Additive properties of certain classes of pathological functions. Absolutely nonmeasurable homomorphisms of commutative groups. Measurable and nonmeasurable sets with homogeneous sections. A combinatorial problem on translation invariant extensions of the Lebesgue measure. Countable almost invariant partitions of G-spaces. Nonmeasurable unions of measure zero sections of plane sets. Measurability properties of well-orderings. Appendices. Bibliography. Subject Index.

Read more less

Book SynopsisA Bridge to Higher Mathematics is more than simply another book to aid the transition to advanced mathematics. The authors intend to assist students in developing a deeper understanding of mathematics and mathematical thought. The only way to understand mathematics is by doing mathematics. The reader will learn the language of axioms and theorems and will write convincing and cogent proofs using quantifiers. Students will solve many puzzles and encounter some mysteries and challenging problems. The emphasis is on proof. To progress towards mathematical maturity, it is necessary to be trained in two aspects: the ability to read and understand a proof and the ability to write a proof. The journey begins with elements of logic and techniques of proof, then with elementary set theory, relations and functions. Peano axioms for positive integers and for natural numbers follow, in particular mathematical and other forms of induction. Next Trade ReviewThis is one of the shorter books for a course that introduces students to the concept of mathematical proofs. The brevity is due to the "bare-bones" nature of the treatment. The number of topics covered, the number of examples, and the number of exercises are not smaller than what appears in competing textbooks; what is shorter is the text that one finds between theorems, lemmas, examples, and exercises. Besides the topics found in similar textbooks (i.e., proof techniques, logic, set theory, relations, and functions), there are chapters on (very) elementary number theory, combinatorial counting techniques, and Peano axioms on the set of positive integers. Several chapters are devoted to the construction of various kinds of numbers, such as integers, rationals, real numbers, and complex numbers. Answers to around half the exercises are included at the end of the book, and a few have complete solutions. This reviewer finds the book more enjoyable than the average competing textbook. --M. Bona, University of FloridaTable of ContentsElements of logicTrue and false statementsLogical connectives and truth tablesLogical equivalenceQuantifiersProofs: Structures and strategiesAxioms, theorems and proofsDirect proofContrapositive proofProof by equivalent statementsProof by casesExistence proofsProof by counterexampleProof by mathematical inductionElementary Theory of Sets. FunctionsAxioms for set theoryInclusion of setsUnion and intersection of setsComplement, difference and symmetric difference of setsOrdered pairs and the Cartersian productFunctionsDefinition and examples of functionsDirect image, inverse imageRestriction and extension of a functionOne-to-one and onto functionsComposition and inverse functions*Family of sets and the axiom of choiceRelationsGeneral relations and operations with relationsEquivalence relations and equivalence classesOrder relations*More on ordered sets and Zorn's lemmaAxiomatic theory of positive integersPeano axioms and additionThe natural order relation and subtractionMultiplication and divisibilityNatural numbersOther forms of inductionElementary number theoryAboslute value and divisibility of integersGreatest common divisor and least common multipleIntegers in base 10 and divisibility testsCardinality. Finite sets, infinite setsEquipotent setsFinite and infinite setsCountable and uncountable setsCounting techniques and combinatoricsCounting principlesPigeonhole principle and parityPermutations and combinationsRecursive sequences and recurrence relationsThe construction of integers and rationals Definition of integers and operationsOrder relation on integersDefinition of rationals, operations and orderDecimal representation of rational numbersThe construction of real and complex numbersThe Dedekind cuts approachThe Cauchy sequences approachDecimal representation of real numbersAlgebraic and transcendental numbersComples numbersThe trigonometric form of a complex number

Read more less