• формат pdf
  • размер 1.85 МБ
  • добавлен 29 октября 2011 г.
Halmos P.R. Naive Set Theory
Издательство Springer, 1974, -76 pp.

Every mathematician agrees that every mathematician must know some set theory; the disagreement begins in trying to decide how much is someю This book contains my answer to that question. The purpose of the book is to tell the beginning student of advanced mathematics the basic set-theoretic facts of life, and to do so with the minimum of philosophical discourse and logical formalism. The point of view throughout is that of a prospective mathematician anxious to study groups, or integrals, or manifolds. From this point of view the concepts and methods of this book are merely some of the standard mathematical tools; the expert specialist will find nothing new here.
Scholarly bibliographical credits and references are out of place in purely expository book such as this one. The student who gets interested in set theory for its own sake should know, however, that there is much more to the subject than there is in this book. One of the most beautiful sources of set-theoretic wisdom is still Hausdorff's Set theory. A recent and highly readable addition to the literature, with an extensive and up-to-date bibliography, is Axiomatic set theory by Suppes.
In set theory "naive" and "axiomatic" arc contrasting words. The present treatment might best be described as axiomatic set theory from the naive point of view. It is axiomatic in that some axioms for set theory are stated and used as the basis of all subsequent proofs. It is naive in that the language and notation are those of ordinary informal (but formalizable) mathematics. A more important way in which the naive point of view predominates is that set theory is regarded as a body of facts, of which the axioms are a brief and convenient summary; in the orthodox axiomatic view the logical relations among various axioms are the central objects of study. Analogously, a study of geometry might be regarded as purely naive if it proceeded on the paper-folding kind of intuition alone; the other extreme, the purely axiomatic one, is the one in which axioms for the various non-Euclidean geometries are studied with the same amount of attention as Euclid's. The analogue of the point of view of this book is the study of just one sane set of axioms with the intention of describing Euclidean geometry only.
Instead of Naive set theory a more honest title for the book would have been An outline of the elements of naive set theory. "Elements" would wa the reader that not everything is here; "outline" would wa him that even what is here needs filling in. The style is usually informal to the point of being conversational. There are very few displayed theorems; most of the facts are just stated and followed by a sketch of a proof, very much as they might be in a general descriptive lecture. There are only a few exercises, officially so labelled, but, in fact, most of the book is nothing but a long chain of exercises with hints. The reader should continually ask himself whether he knows how to jump from one hint to the next, and, accordingly, he should not be discouraged if he finds that his reading rate is considerably slower than normal.
This is not to say that the contents of this book are unusually difficult or profound. What is true is that the concepts are very general and very abstract, and that, therefore, they may take some getting used to. It is a mathematical truism, however, that the more generally a theorem applies, the less deep it is. The student's task in leaing set theory is to steep himself in unfamiliar but essentially shallow generalities till they become so familiar that they can be used with almost no conscious effort. In other words, general set theory is pretty trivial stuff really, but, if you want to be a mathematician, you need some, and here, it is; read it, absorb it, and forget it.

The Axiom of Extension.
The Axiom of Specification.
Unotdered Pairs.
Unions and Intersections.
Complements and Powers.
Ordered Pairs.
Relations.
Functions.
Families.
Inverses and Composites.
Numbers.
The Peano Axioms.
Arithmetic.
Order.
Tile Axiom of Choice.
Zo's Lemma.
Well Ordering.
Transfinite Recursion.
Ordinal Numbers.
Sets of Ordinal Numbers.
Ordinal Arithmetic.
The Schr?der-Bestein Theorem.
Countable Sets.
Cardinal Arithmetic.
Cardinal Numbers.
Похожие разделы
Смотрите также

Capobianco M., Moluzzo J.C. Examples and Counterexamples in Graph Theory

  • формат pdf
  • размер 12.91 МБ
  • добавлен 16 марта 2011 г.
North-Holland, 1978. - 270 pages. It is a real pleasure, indeed an honor, for me to have been invited by Mike Capobianco and John Molluzzo to write an introduction to this imaginative and valuable addition to graph theory. Let me therefore present a few of my thoughts on the current status of graph theory and how their work contributes to the field. Graphs have come a long way since 1736 when Leonhard Euler applied a graph-theoretic argument to...

Chartrand G., Lesniak L. Graphs and Digraphs

  • формат djvu
  • размер 2.67 МБ
  • добавлен 26 октября 2011 г.
Издательство Chapman and Hall/CRC Press, 1996, -429 pp. Graph theory is a major area of combinatorics, and during recent decades, graph theory has developed into a major area of mathematics. In addition to its growing interest and importance as a mathematical subject, it has applications to many fields, including computer science and chemistry. As in the first edition of Graphs & Digraphs (M. Behzad, G. Chartrand, L. Lesniak) and the second...

Desel J., Esparza J. Free Choice Petri Nets

  • формат djvu
  • размер 1.71 МБ
  • добавлен 31 января 2012 г.
Издательство Cambridge University Press, 1995, -254 pp. Free-choice Petri nets have been around for more than twenty years, and are a successful branch of net theory. Nearly all the introductory texts on Petri nets devote some pages to them. This book is intended for those who wish to go further. It brings together the classical theorems of free-choice theory obtained by Commoner and Hack in the seventies, and a selection of new results, like th...

Epstein D.B., Cannon J.W., Holt D.F. et al. Word Processing in Groups

  • формат djvu
  • размер 2.7 МБ
  • добавлен 05 сентября 2011 г.
Jones and Bartlett Publishers, 1992. - 352 Pages. This study in combinatorial group theory introduces the concept of automatic groups. It contains a succinct introduction to the theory of regular languages, a discussion of related topics in combinatorial group theory, and the connections between automatic groups and geometry which motivated the development of this new theory. It is of interest to mathematicians and computer scientists, and inclu...

Givant S., Halmos P. Introduction to Boolean Algebras

  • формат pdf
  • размер 3.54 МБ
  • добавлен 24 октября 2011 г.
Издательство Springer, 2009, -588 pp. Серия Undergraduate Texts in Mathematics The theory of Boolean algebras was created in 1847 by the English mathematician George Boole. He conceived it as a calculus (or arithmetic) suitable for a mathematical analysis of logic. The form of his calculus was rather different from the modern version, which came into being during the period 1864–1895 through the contributions of William Stanley Jevons, Augustus...

Gross J.L., Yellen J. (editors) Handbook of Graph Theory

  • формат pdf
  • размер 9.22 МБ
  • добавлен 01 января 2011 г.
CRC, 2003. - 1192 pages. The Handbook of Graph Theory is the most comprehensive single-source guide to graph theory ever published. Best-selling authors Jonathan Gross and Jay Yellen assembled an outstanding team of experts to contribute overviews of more than 50 of the most significant topics in graph theory-including those related to algorithmic and optimization approaches as well as "pure" graph theory. They then carefully edited the compilat...

Halmos P.R. Naive Set Theory

  • формат pdf
  • размер 52.21 МБ
  • добавлен 25 июня 2011 г.
Springer, 1974. - 104 Pages. From the Reviews: ".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 theor...

Jech T. Set Theory

  • формат pdf
  • размер 14.36 МБ
  • добавлен 02 января 2011 г.
Springer, 2006. - 772 pages. Set Theory has experienced a rapid development in recent years, with major advances in forcing, inner models, large cardinals and descriptive set theory. The present book covers each of these areas, giving the reader an understanding of the ideas involved. It can be used for introductory students and is broad and deep enough to bring the reader near the boundaries of current research. Students and researchers in the...

Ray-Chaudhuri D. Coding Theory and Design Theory. Part I

  • формат pdf
  • размер 10.88 МБ
  • добавлен 15 октября 2011 г.
Издательство Springer, 1990, -252 pp. This book is based on the proceedings of a workshop which was an integral part of the 1987-88 IMA program on Applied Combinatorics. Coding Theory and Design theory are areas of combinatorics which found rich applications of algebraic structures and are closely interconnected. Coding theory has developed into a rich and beautiful example of abstract sophisticated mathematics being applied successfully to solv...

Wallis W.D. A Beginner's Guide to Discrete Mathematics

  • формат pdf
  • размер 3.56 МБ
  • добавлен 17 ноября 2011 г.
Birkhauser, 2011. - 440 pages. This second edition of A Beginner’s Guide to Discrete Mathematics presents a detailed guide to discrete mathematics and its relationship to other mathematical subjects including set theory, probability, cryptography, graph theory, and number theory. This textbook has a distinctly applied orientation and explores a variety of applications. Key Features of the second edition: * Includes a new chapter on the theory...