At the heart of this short introduction to category theory is the idea of a universal property, important throughout mathematics. After an introductory chapter giving the basic definitions, separate chapters explain three ways of expressing universal properties: via adjoint functors, representable functors, and limits. A final chapter ties all three together. The book is suitable for use in courses or for independent study. Assuming relatively little mathematical background, it is ideal for beginning graduate students or advanced undergraduates learning category theory for the first time. For each new categorical concept, a generous supply of examples is provided, taken from different parts of mathematics. At points where the leap in abstraction is particularly great (such as the Yoneda lemma), the reader will find careful and extensive explanations. Copious exercises are included.

This two-volume work bridges the gap between introductory expositions of logic or set theory on one hand, and the research literature on the other. It can be used as a text in an advanced undergraduate or beginning graduate course in mathematics, computer science, or philosophy. The volumes are written in a user-friendly conversational lecture style that makes them equally effective for self-study or class use. Volume II, on formal (ZFC) set theory, incorporates a self-contained 'chapter 0' on proof techniques so that it is based on formal logic, in the style of Bourbaki. The emphasis on basic techniques will provide the reader with a solid foundation in set theory and provides a context for the presentation of advanced topics such as absoluteness, relative consistency results, two expositions of Godel's constructible universe, numerous ways of viewing recursion, and a chapter on Cohen forcing.

This book contains twenty-one essays by leading authorities on aspects of contemporary logic, ranging from foundations of set theory to applications of logic in computing and in the theory of fields. In those parts of logic closest to computer science, the gap between foundations and applications is often small, as illustrated by three essays on the proof theory of non-classical logics. There are also chapters on the lambda calculus, on relating logic programs to inductive definitions, on Buechi and Presburger arithmetics, and on definability in Lindenbaum algebras. Aspects of constructive mathematics discussed are embeddings of Heyting algebras and proofs in mathematical anslysis. Set theory is well covered with six chapters discussing Cohen forcing, Baire category, determinancy, Nash-Williams theory, critical points (and the remarkable connection between them and properties of left distributive operations) and independent structures. The longest chapter in the book is a survey of 0-minimal structures, by Lou van den Dries; during the last ten years these structures have come to take a central place in applications of model theory to fields and function theory, and this chapter is the first broad survey of the area. Other chapters illustrate how to apply model theory to field theory, complex geometry and groups, and how to recover from its automorphism group. Finally, one chapter applies to the theory of toric varieties to solve problems about many-valued logics.

In Parts of Classes, David Lewis outlined a reduction of ZFC to a second order mereology. His conclusion takes on the following form in this reconstruction: ZFC is susceptible to parameterized interpretation in M (classical second order mereology) plus, there is a strongly unreachable partition. The proof makes use of the fact that ordered pairs in M plus an infinite partition are susceptible to parameterized interpretation."

This book is an introduction to set theory in which the author develops the subject from first principles and presupposes little more than an elementary grounding in logic. Throughout much attention is paid to the historical and philosophical background which illuminates the subject's development. This book differs from most by providing a particularly elegant and intuitive approach based on Scott's formulation of standard set theory in which sets are built up stage by stage. This approach has the advantage of introducing the axioms of set theory in a natural way and shows how they come to take the form they do. The book covers all the basic tools of set theory: the natural numbers, cardinals, ordinals, and the axiom of choice in some detail. It also provides an account of the representation theory of lattices and how this is closely connected with the various forms of the axiom of choice.

Philosophical considerations, which are often ignored or treated casually, are given careful consideration in this introduction. Thomas Forster places the notion of inductively defined sets (recursive datatypes) at the center of his exposition resulting in an original analysis of well established topics. The presentation illustrates difficult points and includes many exercises. Little previous knowledge of logic is required and only a knowledge of standard undergraduate mathematics is assumed.

Advanced undergraduate or beginning graduate students need a unified foundation for their study of geometry, analysis, and algebra. For the first time, this book uses categorical algebra to build such a foundation, starting from intuitive descriptions of mathematically and physically common phenomena and advancing to a precise specification of the nature of Categories of Sets. Set theory as the algebra of mappings is introduced and developed as a unifying basis for advanced mathematical subjects such as algebra, geometry, analysis, and combinatorics. The formal study evolves from general axioms that express universal properties of sums, products, mapping sets, and natural number recursion.

In recent years there has been a growing interest in the interactions between descriptive set theory and various aspects of the theory of dynamical systems, including ergodic theory and topological dynamics. This volume, first published in 2000, contains a collection of survey papers by leading researchers covering a wide variety of recent developments in these subjects and their interconnections. This book provides researchers and graduate students interested in either of these areas with a guide to work done in the other, as well as with an introduction to problems and research directions arising from their interconnections.

This text presents methods of modern set theory as tools that can be usefully applied to other areas of mathematics. The author describes numerous applications in abstract geometry and real analysis and, in some cases, in topology and algebra. The book begins with a tour of the basics of set theory, culminating in a proof of Zorn's Lemma and a discussion of some of its applications. The author then develops the notions of transfinite induction and descriptive set theory, with applications to the theory of real functions. The final part of the book presents the tools of "modern" set theory: Martin's Axiom, the Diamond Principle, and elements of forcing. Written primarily as a text for beginning graduate or advanced level undergraduate students, this book should also interest researchers wanting to learn more about set theoretical techniques applicable to their fields.

In one of the finest treatments for upper undergraduate and graduate level students, Professor Suppes presents axiomatic set theory: the basic paradoxes and history of set theory, and advanced topics such as relations and functions, equipollence, finite sets and cardinal numbers, rational and real numbers and more. Exercises. References. Indexes.

This book introduces a new research direction in set theory: the study of models of set theory with respect to their extensional overlap or disagreement. In Part I, the method is applied to isolate new distinctions between Borel equivalence relations. Part II contains applications to independence results in Zermelo-Fraenkel set theory without Axiom of Choice. The method makes it possible to classify in great detail various paradoxical objects obtained using the Axiom of Choice; the classifying criterion is a ZF-provable implication between the existence of such objects. The book considers a broad spectrum of objects from analysis, algebra, and combinatorics: ultrafilters, Hamel bases, transcendence bases, colorings of Borel graphs, discontinuous homomorphisms between Polish groups, and many more. The topic is nearly inexhaustible in its variety, and many directions invite further investigation.

Essentials of Mathematical Thinking addresses the growing need to better comprehend mathematics today. Increasingly, our world is driven by mathematics in all aspects of life. The book is an excellent introduction to the world of mathematics for students not majoring in mathematical studies.

The author has written this book in an enticing, rich manner that will engage students and introduce new paradigms of thought. Careful readers will develop critical thinking skills which will help them compete in today’s world.

The book explains:

What goes behind a Google search algorithm

How to calculate the odds in a lottery

The value of Big Data

How the nefarious Ponzi scheme operates

Instructors will treasure the book for its ability to make the field of mathematics more accessible and alluring with relevant topics and helpful graphics. The author also encourages readers to see the beauty of mathematics and how it relates to their lives in meaningful ways.

Table of Contents

First Thoughts. Diverse Mathematical Thoughts. Strategy. Focus. Science. Counting. Games. Geometry. Practical Matters. Breaking the Code. Discrete Problems. Advanced Ideas. Concluding Remarks

This book is an introduction to modern cardinal arithmetic, developed in the frame of the axioms of Zermelo-Fraenkel set theory together with the axiom of choice. It splits into three parts. Part one, which is contained in Chapter 1, describes the classical cardinal arithmetic due to Bernstein, Cantor, Hausdorff, Konig, and Tarski. The results were found in the years between 1870 and 1930. Part two, which is Chapter 2, characterizes the development of cardinal arith metic in the seventies, which was led by Galvin, Hajnal, and Silver. The third part, contained in Chapters 3 to 9, presents the fundamental investigations in pcf-theory which has been developed by S. Shelah to answer the questions left open in the seventies. All theorems presented in Chapter 3 and Chapters 5 to 9 are due to Shelah, unless otherwise stated. We are greatly indebted to all those set theorists whose work we have tried to expound. Concerning the literature we owe very much to S. Shelah's book [Sh5] and to the article by M. R. Burke and M. Magidor [BM] which also initiated our students' interest for Shelah's pcf-theory.

One of the greatest revolutions in mathematics occurred when Georg Cantor (1845-1918) promulgated his theory of transfinite sets. This revolution is the subject of Joseph Dauben's important studythe most thorough yet writtenof the philosopher and mathematician who was once called a "corrupter of youth" for an innovation that is now a vital component of elementary school curricula.

Set theory has been widely adopted in mathematics and philosophy, but the controversy surrounding it at the turn of the century remains of great interest. Cantor's own faith in his theory was partly theological. His religious beliefs led him to expect paradoxes in any concept of the infinite, and he always retained his belief in the utter veracity of transfinite set theory. Later in his life, he was troubled by recurring attacks of severe depression. Dauben shows that these played an integral part in his understanding and defense of set theory.

Michael 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 Philosophy is a key text for philosophy, mathematical logic, and computer science.

The Philosophy of Mathematics Today gives a panorama of the best current work in this lively field, through twenty essays specially written for this collection by leading figures. The topics include indeterminacy, logical consequence, mathematical methodology, abstraction, and both Hilbert's and Frege's foundational programmes. The collection will be an important source for research in the philosophy of mathematics for years to come.

Contributors Paul Benacerraf, George Boolos, John P. Burgess, Charles S. Chihara, Michael Detlefsen, Michael Dummett, Hartry Field, Kit Fine, Bob Hale, Richard G. Heck, Jnr., Geoffrey Hellman, Penelope Maddy, Karl-Georg Niebergall, Charles D. Parsons, Michael D. Resnik, Matthias Schirn, Stewart Shapiro, Peter Simons, W.W. Tait, Crispin Wright.

The requirement to reason logically forms the basis of all mathematics, and hence mathematical logic is one of the most fundamental topics that students will study. Assuming no prior knowledge of the topic, this book provides an accessible introduction for advanced undergraduate students.

Intermediate 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 students, and a bridge to advanced study of such subjects as model theory, proof theory, and other specialized areas of mathematical logic. This book is intended for university students from second-year und

This book provides an introduction to axiomatic set theory and descriptive set theory. It is written for the upper level undergraduate or beginning graduate students to help them prepare for advanced study in set theory and mathematical logic as well as other areas of mathematics, such as analysis, topology, and algebra.The book is designed as a flexible and accessible text for a one-semester introductory course in set theory, where the existing alternatives may be more demanding or specialized. Readers will learn the universally accepted basis of the field, with several popular topics added as an option. Pointers to more advanced study are scattered throughout the text.

Intended for the undergraduate student majoring in mathematics, physics or engineering, the Sixth Edition of Complex Analysis for Mathematics and Engineering continues to provide a comprehensive, student-friendly presentation of this interesting area of mathematics. The authors strike a balance between the pure and applied aspects of the subject, and present concepts in a clear writing style that is appropriate for students at the junior/senior level. Through its thorough, accessible presentation and numerous applications, the sixth edition of this classic text allows students to work through even the most difficult proofs with ease. New exercise sets help students test their understanding of the material at hand and assess their progress through the course. Additional Mathematica and Maple exercises, as well as a student study guide are also available online.

This text unites the logical and philosophical aspects of set theory in a manner intelligible both to mathematicians without training in formal logic and to logicians without a mathematical background. It combines an elementary level of treatment with the highest possible degree of logical rigor and precision.
Starting with an explanation of all the basic logical terms and related operations, the text progresses through a stage-by-stage elaboration that proves the fundamental theorems of finite sets. It focuses on the Bernays theory of finite classes and finite sets, exploring the system's basis and development, including Stage I and Stage II theorems, the theory of finite ordinals, and the theory of finite classes and finite sets. This volume represents an excellent text for undergraduates studying intermediate or advanced logic as well as a fine reference for professional mathematicians.

In this book, Claire Voisin provides 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. The volume is intended for both students and researchers, and not only presents a survey of the geometric methods developed in the last thirty years to understand the famous Bloch-Beilinson conjectures, but also examines recent work by Voisin. The book focuses on two central objects: the diagonal of a variety--and the partial Bloch-Srinivas type decompositions it may have depending on the size of Chow groups--as well as its small diagonal, which is the right object to consider in order to understand the ring structure on Chow groups and cohomology. An exploration of a sampling of recent works by Voisin looks at the relation, conjectured in general by Bloch and Beilinson, between the coniveau of general complete intersections and their Chow groups and a very particular property satisfied by the Chow ring of K3 surfaces and conjecturally by hyper-Kahler manifolds. In particular, the book delves into arguments originating in Nori's work that have been further developed by others."

Suitable for upper-level undergraduates, this accessible approach to set theory poses rigorous but simple arguments. Each definition is accompanied by commentary that motivates and explains new concepts. Starting with a repetition of the familiar arguments of elementary set theory, the level of abstract thinking gradually rises for a progressive increase in complexity.
A historical introduction presents a brief account of the growth of set theory, with special emphasis on problems that led to the development of the various systems of axiomatic set theory. Subsequent chapters explore classes and sets, functions, relations, partially ordered classes, and the axiom of choice. Other subjects include natural and cardinal numbers, finite and infinite sets, the arithmetic of ordinal numbers, transfinite recursion, and selected topics in the theory of ordinals and cardinals. This updated edition features new material by author Charles C. Pinter.

Kurt Godel, mathematician and logician, was one of the most influential thinkers of the twentieth century. Godel fled Nazi Germany, fearing for his Jewish wife and fed up with Nazi interference in the affairs of the mathematics institute at the University of Gottingen. In 1933 he settled at the Institute for Advanced Study in Princeton, where he joined the group of world-famous mathematicians who made up its original faculty.

His 1940 book, better known by its short title, "The Consistency of the Continuum Hypothesis," is a classic of modern mathematics. The continuum hypothesis, introduced by mathematician George Cantor in 1877, states that there is no set of numbers between the integers and real numbers. It was later included as the first of mathematician David Hilbert's twenty-three unsolved math problems, famously delivered as a manifesto to the field of mathematics at the International Congress of Mathematicians in Paris in 1900. In "The Consistency of the Continuum Hypothesis" Godel set forth his proof for this problem.

In 1999, "Time" magazine ranked him higher than fellow scientists Edwin Hubble, Enrico Fermi, John Maynard Keynes, James Watson, Francis Crick, and Jonas Salk. He is most renowned for his proof in 1931 of the 'incompleteness theorem, ' in which he demonstrated that there are problems that cannot be solved by any set of rules or procedures. His proof wrought fruitful havoc in mathematics, logic, and beyond."