• формат pdf
  • размер 1.8 МБ
  • добавлен 29 октября 2011 г.
Moschovakis Y. Notes on Set Theory
Издательство Springer, 2006, -284 pp.
Серия Undergraduate Texts in Mathematics

What this book is about. The theory of sets is a vibrant, exciting mathematical theory, with its own basic notions, fundamental results and deep open problems, and with significant applications to other mathematical theories. At the same time, axiomatic set theory is often viewed as a foundation of mathematics: it is alleged that all mathematical objects are sets, and their properties can be derived from the relatively few and elegant axioms about sets. Nothing so simple-minded can be quite true, but there is little doubt that in standard, current mathematical practice, making a notion precise is essentially synonymous with defining it in set theory. Set theory is the official language of mathematics, just as mathematics is the official language of science. Like most authors of elementary, introductory books about sets, I have tried to do justice to both aspects of the subject.
From straight set theory, these Notes cover the basic facts about abstract sets, including the Axiom of Choice, transfinite recursion, and cardinal and ordinal numbers. Somewhat less common is the inclusion of a chapter on pointsets which focuses on results of interest to analysts and introduces the reader to the Continuum Problem, central to set theory from the very beginning. There is also some novelty in the approach to cardinal numbers, which are brought in very early (following Cantor, but somewhat deviously), so that the basic formulas of cardinal arithmetic can be taught as quickly as possible. AppendixAgives a more detailed construction of the real numbers than is common nowadays, which in addition claims some novelty of approach and detail. Appendix B is a somewhat eccentric, mathematical introduction to the study of natural models of various set theoretic principles, including Aczel’s Antifoundation. It assumes no knowledge of logic, but should drive the serious reader to study it.
About set theory as a foundation of mathematics, there are two aspects of these Notes which are somewhat uncommon. First, I have taken seriously this business about everything being a set (which of course it is not) and have tried to make sense of it in terms of the notion of faithful representation of mathematical objects by structured sets. An old idea, but perhaps this is the first textbook which takes it seriously, tries to explain it, and applies it consistently. Those who favor category theory will recognize some of its basic notions in places, shamelessly folded into a traditional set theoretical approach to the foundations where categories are never mentioned. Second, computation theory is viewed as part of the mathematics to be founded and the relevant set theoretic results have been included, along with several examples. The ambition was to explain what every young mathematician or theoretical computer scientist needs to know about sets.

Introduction.
Equinumerosity.
Paradoxes and axioms.
Are sets all there is?
The natural numbers.
Fixed points.
Well ordered sets.
Choices.
Choice’s consequences.
Baire space.
Replacement and other axioms.
Ordinal numbers.
A. The real numbers.
B. Axioms and universes.
Solutions to the exercises.
Похожие разделы
Смотрите также

Berstel J., Lauve A., Reutenauer C., Saliola F. Combinatorics on Words. Christoffel Words and Repetition in Words

  • формат pdf
  • размер 2.63 МБ
  • добавлен 27 декабря 2011 г.
Centre de Recherches Math?matiques, Montr?al, 2008, -202 pp. This book grew out of two series of five two-hour lectures, given by Jean Berstel and Christophe Reutenauer in March 2007. Notes for the lectures were written down by Aaron Lauve and Franco Saliola. They have augmented their notes with several topics and have added more than 100 exercises. There has been a lot of work in adding bibliographic references and a detailed index. The text is...

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...

Kisacanin B. Mathematical Problems and Proofs: Combinatorics, Number Theory, and Geometry

  • формат djvu
  • размер 1.31 МБ
  • добавлен 31 января 2012 г.
Kluwer Academic Publishers, 2002. - 220 pages. Key to Symbols. Set Theory. Sets and Elementary Set Operations. Cartesian Product and Relations. Functions and Operations. Cardinality. Problems. Combinatorics. Four Enumeration Principles. Introductory Problems. Basic Definitions. Generating Functions. Problems. Number Theory. Divisibility of Numbers. Important Functions in Number Theory. Congruences. Diophantine Equations. Problems. Geometry. Prope...

Kung J.P., Rota G.-C., Yan C.H. Combinatorics: The Rota Way

  • формат pdf
  • размер 2.17 МБ
  • добавлен 29 января 2011 г.
Cambridge University Press, 2009. - 408 pages. Written by two of Gian-Carlo Rota's former students, this book is based on notes from his courses and on personal discussions with him. Topics include sets and valuations, partially ordered sets, distributive lattices, partitions and entropy, matching theory, free matrices, doubly stochastic matrices, Moebius functions, chains and antichains, Sperner theory, commuting equivalence relations and linea...

Leung K.-T., Chen D.L.-C. Elementary Set Theory

  • формат pdf
  • размер 5 МБ
  • добавлен 01 января 2011 г.
Hong Kong University Press, 1991. - 148 pages. Elementary Set Theory is an extension of the lecture notes for the course 'Fundamental Concepts of Mathematics' given each year to first-year undergraduate students of mathematics in the University of Hong Kong since 1959. The purpose of this course, arranged in about twenty-five lectures, is to provide students of mathematics with the minimum amount of knowledge in logic and set theory needed for a...

Loebl M. Discrete Mathematics in Statistical Physics. Introductory Lectures

  • формат pdf
  • размер 1.45 МБ
  • добавлен 28 октября 2011 г.
Издательство Vieweg+Teubner, 2010, -186 pp. The purpose of these lecture notes is to briefly describe some of the basic concepts interlacing discrete mathematics, statistical physics and knot theory. I tried to emphasize a ’combinatorial common sense’ as the main method. No attempt of completeness was made. The book should be accessible to the students of both mathematics and physics. I profited from previous books and expositions on discrete ma...

Lothaire M. Algebraic Combinatorics on Words

  • формат djvu
  • размер 4.52 МБ
  • добавлен 15 декабря 2011 г.
Издательство Cambridge University Press, 2002, -515 pp. Combinatorics on words is a field that has grown separately within several branches of mathematics, such as number theory, group theory or probability theory, and appears frequently in problems of theoretical computer science, as dealing with automata and formal languages. A unified treatment of the theory appeared in Lothaire's Combi- Combinatorics on Words. Since then, the field has grown...

Milner R. A Calculus of Communicating Systems

  • формат djvu
  • размер 2.06 МБ
  • добавлен 15 декабря 2011 г.
Издательство Springer, 1980, -176 pp. These notes present a calculus of concurrent systems. The presentation is partly informal, and aimed at practice; we unfold the calculus through the medium of examples each of which illustrates first its expressive power, and second the techniques which it offers for verifying properties of a system. A useful calculus, of computing systems as of anything else, must have a high level of articulacy in a full...

Novak L., Gibbons A. Hybrid Graph Theory and Network Analysis

  • формат djvu
  • размер 1.2 МБ
  • добавлен 02 февраля 2012 г.
Издательство Cambridge University Press, 1999, -187 pp. This research monograph is concerned with two dual structures in graphs. These structures, one based on the concept of a circuit and the other on the concept of a cutset are strongly interdependent and constitute a hybrid structure called a graphoid. This approach to graph theory dealing with graphoidal structures we call hybrid graph theory. A large proportion of our material is either new...

Paine S.E. Applied Combinatorics

  • формат pdf
  • размер 861.44 КБ
  • добавлен 06 января 2012 г.
University of Colorado, 2003, -216 pp. The course at CU-Denver for which these notes were assembled, Math 6409 (Applied Combinatorics), deals more or less entirely with enumerative combinatorics. Other courses deal with combinatorial structures such as Latin squares, designs of many types, finite geometries, etc. This course is a one semester course, but as it has been taught different ways in different semesters, the notes have grown to contain...