Author: Nikolai Konstantinovich Vereshchagin
Publisher: American Mathematical Soc.
ISBN: 0821827316
Category : Mathematics
Languages : en
Pages : 130

View

Book Description
The main notions of set theory (cardinals, ordinals, transfinite induction) are fundamental to all mathematicians, not only to those who specialize in mathematical logic or set-theoretic topology. Basic set theory is generally given a brief overview in courses on analysis, algebra, or topology, even though it is sufficiently important, interesting, and simple to merit its own leisurely treatment. This book provides just that: a leisurely exposition for a diversified audience. It is suitable for a broad range of readers, from undergraduate students to professional mathematicians who want to finally find out what transfinite induction is and why it is always replaced by Zorn's Lemma. The text introduces all main subjects of ``naive'' (nonaxiomatic) set theory: functions, cardinalities, ordered and well-ordered sets, transfinite induction and its applications, ordinals, and operations on ordinals. Included are discussions and proofs of the Cantor-Bernstein Theorem, Cantor's diagonal method, Zorn's Lemma, Zermelo's Theorem, and Hamel bases. With over 150 problems, the book is a complete and accessible introduction to the subject.

Author: Azriel Levy
Publisher: Courier Corporation
ISBN: 0486150739
Category : Mathematics
Languages : en
Pages : 418

View

Book Description
Although this book deals with basic set theory (in general, it stops short of areas where model-theoretic methods are used) on a rather advanced level, it does it at an unhurried pace. This enables the author to pay close attention to interesting and important aspects of the topic that might otherwise be skipped over. Written for upper-level undergraduate and graduate students, the book is divided into two parts. The first covers pure set theory, including the basic notions, order and well-foundedness, cardinal numbers, the ordinals, and the axiom of choice and some of its consequences. The second part deals with applications and advanced topics, among them a review of point set topology, the real spaces, Boolean algebras, and infinite combinatorics and large cardinals. A helpful appendix deals with eliminability and conservation theorems, while numerous exercises supply additional information on the subject matter and help students test their grasp of the material. 1979 edition. 20 figures.

Author: Michael D. Potter
Publisher: Clarendon Press
ISBN: 9780199269730
Category : Mathematics
Languages : en
Pages : 345

View

Book Description
A wonderful new book ... Potter has written the best philosophical introduction to set theory on the market - Timothy Bays, Notre Dame Philosophical Reviews.

Author: Joseph Breuer
Publisher: Courier Corporation
ISBN: 0486154874
Category : Mathematics
Languages : en
Pages : 130

View

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

Author: Charles C Pinter
Publisher: Courier Corporation
ISBN: 0486497089
Category : Mathematics
Languages : en
Pages : 259

View

Book Description
"This accessible approach to set theory for upper-level undergraduates poses rigorous but simple arguments. Each definition is accompanied by commentary that motivates and explains new concepts. A historical introduction is followed by discussions of classes and sets, functions, natural and cardinal numbers, the arithmetic of ordinal numbers, and related topics. 1971 edition with new material by the author"--

Author: Glynn Winskel
Publisher: MIT Press
ISBN: 9780262731034
Category : Computers
Languages : en
Pages : 388

View

Book Description
The Formal Semantics of Programming Languages provides the basic mathematical techniques necessary for those who are beginning a study of the semantics and logics of programming languages. These techniques will allow students to invent, formalize, and justify rules with which to reason about a variety of programming languages. Although the treatment is elementary, several of the topics covered are drawn from recent research, including the vital area of concurency. The book contains many exercises ranging from simple to miniprojects.Starting with basic set theory, structural operational semantics is introduced as a way to define the meaning of programming languages along with associated proof techniques. Denotational and axiomatic semantics are illustrated on a simple language of while-programs, and fall proofs are given of the equivalence of the operational and denotational semantics and soundness and relative completeness of the axiomatic semantics. A proof of Godel's incompleteness theorem, which emphasizes the impossibility of achieving a fully complete axiomatic semantics, is included. It is supported by an appendix providing an introduction to the theory of computability based on while-programs. Following a presentation of domain theory, the semantics and methods of proof for several functional languages are treated. The simplest language is that of recursion equations with both call-by-value and call-by-name evaluation. This work is extended to lan guages with higher and recursive types, including a treatment of the eager and lazy lambda-calculi. Throughout, the relationship between denotational and operational semantics is stressed, and the proofs of the correspondence between the operation and denotational semantics are provided. The treatment of recursive types - one of the more advanced parts of the book - relies on the use of information systems to represent domains. The book concludes with a chapter on parallel programming languages, accompanied by a discussion of methods for specifying and verifying nondeterministic and parallel programs.

Author: Yiannis Moschovakis
Publisher: Springer Science & Business Media
ISBN: 1475741537
Category : Mathematics
Languages : en
Pages : 280

View

Book Description
What this book is about. The theory of sets is a vibrant, exciting math ematical 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 foun dation ofmathematics: 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 "ab stract sets," including the Axiom of Choice, transfinite recursion, and car dinal 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.

Author: Winfried Just
Publisher: American Mathematical Soc.
ISBN: 0821802666
Category : Mathematics
Languages : en
Pages : 230

View

Book Description
This book bridges the gap between the many elementary introductions to set theory that are available today and the more advanced, specialized monographs. The authors have taken great care to motivate concepts as they are introduced. The large number of exercises included make this book especially suitable for self-study. Students are guided towards their own discoveries in a lighthearted, yet rigorous manner.

Author: Richard Kohar
Publisher: World Scientific Publishing Company
ISBN: 9814730416
Category : Mathematics
Languages : en
Pages : 733

View

Book Description
This lively introductory text exposes the student in the humanities to the world of discrete mathematics. A problem-solving based approach grounded in the ideas of George Pólya are at the heart of this book. Students learn to handle and solve new problems on their own. A straightforward, clear writing style and well-crafted examples with diagrams invite the students to develop into precise and critical thinkers. Particular attention has been given to the material that some students find challenging, such as proofs. This book illustrates how to spot invalid arguments, to enumerate possibilities, and to construct probabilities. It also presents case studies to students about the possible detrimental effects of ignoring these basic principles. The book is invaluable for a discrete and finite mathematics course at the freshman undergraduate level or for self-study since there are full solutions to the exercises in an appendix.'Written with clarity, humor and relevant real-world examples, Basic Discrete Mathematics is a wonderful introduction to discrete mathematical reasoning.'- Arthur Benjamin, Professor of Mathematics at Harvey Mudd College, and author of The Magic of Math

Author: Paul Halmos
Publisher:
ISBN: 9781950217014
Category :
Languages : en
Pages : 98

View

Book Description
Written by a prominent analyst Paul. R. Halmos, this book is the most famous, popular, and widely used textbook in the subject. The book is readable for its conciseness and clear explanation. This emended edition is with completely new typesetting and corrections. Asymmetry of the book cover is due to a formal display problem. Actual books are printed symmetrically. Please look at the paperback edition for the correct image. The free PDF file available on the publisher's website www.bowwowpress.org