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.

While intuitionistic (or constructive) set theory IST has received a certain attention from mathematical logicians, so far as I am aware no book providing a systematic introduction to the subject has yet been published. This may be the case in part because, as a form of higher-order intuitionistic logic - the internal logic of a topos - IST has been chiefly developed in a tops-theoretic context. In particular, proofs of relative consistency with IST for mathematical assertions have been (implicitly) formulated in topos- or sheaf-theoretic terms, rather than in the framework of Heyting-algebra-valued models, the natural extension to IST of the well-known Boolean-valued models for classical set theory. In this book I offer a brief but systematic introduction to IST which develops the subject up to and including the use of Heyting-algebra-valued models in relative consistency proofs. I believe that IST, presented as it is in the familiar language of set theory, will appeal particularly to those logicians, mathematicians and philosophers who are unacquainted with the methods of topos theory.

Introduction to Modern Set Theory is designed for a one-semester course in set theory at the advanced undergraduate or beginning graduate level. Three features are the full integration into the text of the study of models of set theory, the use of illustrative examples both in the text and in the exercises, and the integration of consistency results and large cardinals into the text early on. This book is aimed at two audiences: students who are interested in studying set theory for its own sake, and students in other areas who may be curious about applications of set theory to their field. In particular, great care is taken to develop the intuitions that lie behind modern, as well as classical, set theory, and to connect set theory with the rest of mathematics.

Ernst Zermelo (1871-1953) is regarded as the founder of axiomatic set theory and best-known for the first formulation of the axiom of choice. However, his papers include also pioneering work in applied mathematics and mathematical physics.

This edition of his collected papers will consist of two volumes. Besides providing a biography, the present Volume I covers set theory, the foundations of mathematics, and pure mathematics and is supplemented by selected items from his Nachlass and part of his translations of Homer's Odyssey. Volume II will contain his work in the calculus of variations, applied mathematics, and physics.

The papers are each presented in their original language together with an English translation, the versions facing each other on opposite pages. Each paper or coherent group of papers is preceded by an introductory note provided by an acknowledged expert in the field which comments on the historical background, motivations, accomplishments, and influence.

Grigori Mints is one the most distinguished proof theorists of our time. He has contributed significantly not only to the subject in general but also to most of its applications. This collection of papers by a number of Mints' colleagues worldwide are both a personal tribute and a testimony to his breadth and importance by dealing with all areas in which Mints has worked: from proof-theoretical reductions through non-classical logics and category theory to automated theorem proving and proof mining, i.e., the extraction of mathematical information from formal proofs. The collection itself is significant for another reason: it bridges the two logical worlds in which Mints has worked, the world of the former Soviet Union and that of the West.

2011 Reprint of 1960 Edition. Full facsimile of the original edition, not reproduced with Optical Recognition Software. Paul Richard Halmos (1916-2006) was a Hungarian-born American mathematician who made fundamental advances in the areas of probability theory, statistics, operator theory, ergodic theory, and functional analysis (in particular, Hilbert spaces). He was also recognized as a great mathematical expositor. ..".He (the author) uses the language and notation of ordinary informal mathematics to state the basic set-theoretic facts which a beginning student of advanced mathematics needs to know...Because of the informal method of presentation, the book is eminently suited for use as a textbook or for self-study. The reader should derive from this volume a maximum of understanding of the theorems of set theory and of their basic importance in the study of mathematics." - "Philosophy and Phenomenological Research."

2010 Reprint of 1915 Edition. Georg Ferdinand Ludwig Philipp Cantor was a German mathematician, best known as the inventor of set theory, which has become a fundamental theory in mathematics. Cantor established the importance of one-to-one correspondence between sets, defined infinite and well-ordered sets, and proved that the real numbers are "more numerous" than the natural numbers. In fact, Cantor's theorem implies the existence of an "infinity of infinities." He defined the cardinal and ordinal numbers and their arithmetic. Cantor's work is of great philosophical interest, a fact of which he was well aware. In 1895-97 Cantor fully propounded his view of continuity and the infinite, including infinite ordinals and cardinals, in his best known work, Contributions to the Founding of the Theory of Transfinite Numbers . This work contains his conception of transfinite numbers, to which he was led by his demonstration that an infinite set may be placed in a one-to-one correspondence with one of its subsets.

Reprint. Paperback. 387 pp. Diophantus of Alexandria, sometimes called "the father of algebra," was an Alexandrian mathematician and the author of a series of books called Arithmetica. These texts deal with solving algebraic equations, many of which are now lost. In studying Arithmetica, Pierre de Fermat concluded that a certain equation considered by Diophantus had no solutions, and noted without elaboration that he had found "a truly marvelous proof of this proposition," now referred to as Fermat's Last Theorem. This led to tremendous advances in number theory, and the study of diophantine equations ("diophantine geometry") and of diophantine approximations remain important areas of mathematical research. Diophantus was the first Greek mathematician who recognized fractions as numbers; thus he allowed positive rational numbers for the coefficients and solutions. In modern use, diophantine equations are usually algebraic equations with integer coefficients, for which integer solutions are sought. Diophantus also made advances in mathematical notation. Heath's work is one of the standard books in the field.

This exploration of a notorious mathematical problem is the work of the man who discovered the solution. The independence of the continuum hypothesis is the focus of this study by Paul J. Cohen. It presents not only an accessible technical explanation of the author's landmark proof but also a fine introduction to mathematical logic. An emeritus professor of mathematics at Stanford University, Dr. Cohen won two of the most prestigious awards in mathematics: in 1964, he was awarded the American Mathematical Society's Bocher Prize for analysis; and in 1966, he received the Fields Medal for Logic.
In this volume, the distinguished mathematician offers an exposition of set theory and the continuum hypothesis that employs intuitive explanations as well as detailed proofs. The self-contained treatment includes background material in logic and axiomatic set theory as well as an account of Kurt Godel's proof of the consistency of the continuum hypothesis. An invaluable reference book for mathematicians and mathematical theorists, this text is suitable for graduate and postgraduate students and is rich with hints and ideas that will lead readers to further work in mathematical logic.

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.

Russell's paradox arises when we consider those sets that do not belong to themselves. The collection of such sets cannot constitute a set. Step back a bit. Logical formulas define sets (in a standard model). Formulas, being mathematical objects, can be thought of as sets themselves-mathematics reduces to set theory. Consider those formulas that do not belong to the set they define. The collection of such formulas is not definable by a formula, by the same argument that Russell used. This quickly gives Tarski's result on the undefinability of truth. Variations on the same idea yield the famous results of Godel, Church, Rosser, and Post. This book gives a full presentation of the basic incompleteness and undecidability theorems of mathematical logic in the framework of set theory. Corresponding results for arithmetic follow easily, and are also given. Godel numbering is generally avoided, except when an explicit connection is made between set theory and arithmetic. The book assumes little technical background from the reader. One needs mathematical ability, a general familiarity with formal logic, and an understanding of the completeness theorem, though not its proof. All else is developed and formally proved, from Tarski's Theorem to Godel's Second Incompleteness Theorem. Exercises are scattered throughout.

This text introduces topos theory, a development in category theory that unites important but seemingly diverse notions from algebraic geometry, set theory, and intuitionistic logic. Topics include local set theories, fundamental properties of toposes, sheaves, local-valued sets, and natural and real numbers in local set theories. 1988 edition.

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.

Studies in Logic and the Foundations of Mathematics, Volume 102: Set Theory: An Introduction to Independence Proofs offers an introduction to relative consistency proofs in axiomatic set theory, including combinatorics, sets, trees, and forcing. The book first tackles the foundations of set theory and infinitary combinatorics. Discussions focus on the Suslin problem, Martin's axiom, almost disjoint and quasi-disjoint sets, trees, extensionality and comprehension, relations, functions, and well-ordering, ordinals, cardinals, and real numbers. The manuscript then ponders on well-founded sets and easy consistency proofs, including relativization, absoluteness, reflection theorems, properties of well-founded sets, and induction and recursion on well-founded relations. The publication examines constructible sets, forcing, and iterated forcing. Topics include Easton forcing, general iterated forcing, Cohen model, forcing with partial functions of larger cardinality, forcing with finite partial functions, and general extensions. The manuscript is a dependable source of information for mathematicians and researchers interested in set theory.

0 Basic Facts.- 1 Hey's Theorem and Consequences.- 2 Siegel-Weyl Reduction Theory.- 3 The Tamagawa Number and the Volume of G(?)/G(?).- 3.1 Statement of the main result.- 3.2 Proof of 3.1.- 3.3 The volume of G(?)/G(?).- 4 The Size of ?.- 4.1 Statement of results.- 4.2 Proofs.- 5 Margulis' Finiteness Theorem.- 5.1 The Result.- 5.2 Amenable groups.- 5.3 Kazhdan's property (T).- 5.4 Proof of 5.1; beginning.- 5.5 Interlude: parabolics and their opposites.- 5.6 Continuation of the proof.- 5.7 Contracting automorphisms and the Moore Ergodicity theorem.- 5.8 End of proof.- 5.9 Appendix on measure theory.- 6 A Zariski Dense and a Free Subgroup of ?.- 7 An Example.- 8 Problems.- 8.1 Generators.- 8.2 The congruence problem.- 8.3 Betti numbers.- References.

Fuzzy Cluster Analysis presents advanced and powerful fuzzy clustering techniques. This thorough and self-contained introduction to fuzzy clustering methods and applications covers classification, image recognition, data analysis and rule generation. Combining theoretical and practical perspectives, each method is analysed in detail and fully illustrated with examples. Features include:

• Sections on inducing fuzzy if-then rules by fuzzy clustering and non-alternating optimization fuzzy clustering algorithms
• Discussion of solid fuzzy clustering techniques like the fuzzy c-means, the Gustafson-Kessel and the Gath-and-Geva algorithm for classification problems
• Focus on linear and shell clustering techniques used for detecting contours in image analysis
• Accompanying software and data sets pertaining to the examples presented, enabling the reader to learn through experimentation
• Examination of the difficulties involved in evaluating the results of fuzzy cluster analysis and of determining the number of clusters with analysis of global and local validity measures
• Description of different fuzzy clustering techniques allowing the user to select the method most appropriate to a particular problem

This is the second volume of a two-volume graduate text in set theory. The first volume covered the basics of modern set theory and was addressed primarily to beginning graduate students. This second volume is intended as a bridge between introductory set theory courses and advanced monographs that cover selected branches of set theory, such as forcing or large cardinals. The authors give short but rigorous introductions to set-theoretic concepts and techniques such as trees, partition calculus, cardinal invariants of the continuum, Martin's Axiom, closed unbounded and stationary sets, the Diamond Principle ($\diamond$), and the use of elementary submodels. Great care has been taken to motivate the concepts and theorems presented. The book is written as a dialogue with the reader.The presentation is interspersed with numerous exercises. The authors wish to entice readers into active participation in discovering the mathematics presented, making the book particularly suitable for self-study. Each topic is presented rigorously and in considerable detail. Carefully planned exercises lead the reader to active mastery of the techniques presented. Suggestions for further reading are given. Volume II can be read independently of Volume I.

Large cardinal hypotheses play a central role in modern set theory. One important way to understand such hypotheses is to construct concrete, minimal universes, or "core models," satisfying them. Since Godel's pioneering work on the universe of constructible sets, several larger core models satisfying stronger hypotheses have been constructed, and these have proved quite useful. Here the author extends this theory so that it can produce core models satisfying "There is a Woodin cardinal," a large cardinal hypothesis which is the focus of much current research. The book is intended for advanced graduate students and reseachers in set theory."

Fuzzy knowledge and fuzzy systems affect our lives today as systems enter the world of commerce. Fuzzy systems are incorporated in domestic appliances (washing machine, air conditioning, microwave, telephone) and in transport systems (a pilotless helicopter has recently completed a test flight). Future applications are expected to have dramatic implications for the demand for labor, among other things. It was with such thoughts in mind that this first international survey of future applications of fuzzy logic has been undertaken. The results are likely to be predictive for a decade beyond the millenium. The predictive element is combined with a bibliography which serves as an historical anchor as well as being both extensive and extremely useful. Analysis and Evaluation of Fuzzy Systems is thus a milestone in the development of fuzzy logic and applications of three representative subsystems: Fuzzy Control, Fuzzy Pattern Recognition and Fuzzy Communications.

This work is devoted to a study of various relations between non-classical logics and fuzzy sets. This volume is aimed at all those who are interested in a deeper understanding of the mathematical foundations of fuzzy set theory, particularly in intuitionistic logic, Lukasiewicz logic, monoidal logic, fuzzy logic and topos-like categories. The tutorial nature of the longer chapters, the comprehensive bibliography and index should make it suitable as a valuable and important reference for graduate students as well as research workers in the field of non-classical logics. The book is arranged in three parts: part A presents the most recent developments in the theory of Heyting algebras, MV-algebras, quantales and GL-monoids; part B gives a coherent and current account of topos-like categories for fuzzy set theory based on Heyting algebra valued sets, quantal sets of M-valued sets; part C addresses general aspects of non-classical logics including epistemological problems as well as recursive properties of fuzzy logic.

1988 marked the first centenary of Recursion Theory, since Dedekind's 1888 paper on the nature of number. Now available in paperback, this book is both a comprehensive reference for the subject and a textbook starting from first principles.

Among the subjects covered are: various equivalent approaches to effective computability and their relations with computers and programming languages; a discussion of Church's thesis; a modern solution to Post's problem; global properties of Turing degrees; and a complete algebraic characterization of many-one degrees. Included are a number of applications to logic (in particular Godel's theorems) and to computer science, for which Recursion Theory provides the theoretical foundation.

This reprint of the original 1914 edition of this famous work contains many topics that had to be omitted from later editions, notably, Symmetric Sets, Principle of Duality, most of the 'Algebra' of Sets, Partially Ordered Sets, Arbitrary Sets of Complexes, Normal Types, Initial and Final Ordering, Complexes of Real Numbers, General Topological Spaces, Euclidean Spaces, the Special Methods Applicable in the Euclidean Plane, Jordan's Separation Theorem, the Theory of Content and Measure, the Theory of the Lebesgue Integral. The text is in German.

Les buts principaux de cet ouvrage qui comble un vide sont de:

- donner les concepts et r sultats fondamentaux sur les ensembles ordonn?'s finis,

- pr senter leurs usages dans des domaines vari?'s (de la RO ou l IA la micro- conomie),

- signaler un certain nombre de r sultats et de recherches en cours.