**Author**: H. Rubin,J.E. Rubin

**Publisher:** Elsevier

**ISBN:** 9780080887654

**Category:** Mathematics

**Page:** 321

**View:** 9764

This monograph contains a selection of over 250 propositions which are equivalent to AC. The first part on set forms has sections on the well-ordering theorem, variants of AC, the law of the trichotomy, maximal principles, statements related to the axiom of foundation, forms from algebra, cardinal number theory, and a final section of forms from topology, analysis and logic. The second part deals with the axiom of choice for classes - well-ordering theorem, choice and maximal principles.

This book provides a self-contained introduction to modern set theory and also opens up some more advanced areas of current research in this field. The first part offers an overview of classical set theory wherein the focus lies on the axiom of choice and Ramsey theory. In the second part, the sophisticated technique of forcing, originally developed by Paul Cohen, is explained in great detail. With this technique, one can show that certain statements, like the continuum hypothesis, are neither provable nor disprovable from the axioms of set theory. In the last part, some topics of classical set theory are revisited and further developed in the light of forcing. The notes at the end of each chapter put the results in a historical context, and the numerous related results and the extensive list of references lead the reader to the frontier of research. This book will appeal to all mathematicians interested in the foundations of mathematics, but will be of particular use to graduates in this field.

AC, the axiom of choice, because of its non-constructive character, is the most controversial mathematical axiom, shunned by some, used indiscriminately by others. This treatise shows paradigmatically that: - Disasters happen without AC: Many fundamental mathematical results fail (being equivalent in ZF to AC or to some weak form of AC). - Disasters happen with AC: Many undesirable mathematical monsters are being created (e.g., non measurable sets and undeterminate games). - Some beautiful mathematical theorems hold only if AC is replaced by some alternative axiom, contradicting AC (e.g., by AD, the axiom of determinateness). Illuminating examples are drawn from diverse areas of mathematics, particularly from general topology, but also from algebra, order theory, elementary analysis, measure theory, game theory, and graph theory.

This text for the first or second year undergraduate in mathematics, logic, computer science, or social sciences, introduces the reader to logic, proofs, sets, and number theory. It also serves as an excellent independent study reference and resource for instructors. Adapted from Foundations of Logic and Mathematics: Applications to Science and Cryptography © 2002 Birkhӓuser, this second edition provides a modern introduction to the foundations of logic, mathematics, and computers science, developing the theory that demonstrates construction of all mathematics and theoretical computer science from logic and set theory. The focuses is on foundations, with specific statements of all the associated axioms and rules of logic and set theory, and provides complete details and derivations of formal proofs. Copious references to literature that document historical development is also provided. Answers are found to many questions that usually remain unanswered: Why is the truth table for logical implication so unintuitive? Why are there no recipes to design proofs? Where do these numerous mathematical rules come from? What issues in logic, mathematics, and computer science still remain unresolved? And the perennial question: In what ways are we going to use this material? Additionally, the selection of topics presented reflects many major accomplishments from the twentieth century and includes applications in game theory and Nash's equilibrium, Gale and Shapley's match making algorithms, Arrow's Impossibility Theorem in voting, to name a few. From the reviews of the first edition: "...All the results are proved in full detail from first principles...remarkably, the arithmetic laws on the rational numbers are proved, step after step, starting from the very definitions!...This is a valuable reference text and a useful companion for anybody wondering how basic mathematical concepts can be rigorously developed within set theory." —MATHEMATICAL REVIEWS "Rigorous and modern in its theoretical aspect, attractive as a detective novel in its applied aspects, this paper book deserves the attention of both beginners and advanced students in mathematics, logic and computer sciences as well as in social sciences." —Zentralblatt MATH

This text covers the parts of contemporary set theory relevant to other areas of pure mathematics. After a review of "naïve" set theory, it develops the Zermelo-Fraenkel axioms of the theory before discussing the ordinal and cardinal numbers. It then delves into contemporary set theory, covering such topics as the Borel hierarchy and Lebesgue measure. A final chapter presents an alternative conception of set theory useful in computer science.

Classic undergraduate text acquaints students with fundamental concepts and methods of mathematics. Topics include axiomatic method, set theory, infinite sets, groups, intuitionism, formal systems, mathematical logic, and much more. 1965 second edition.

The gap between the rote, calculational learning mode of calculus and ordinary differential equations and the more theoretical learning mode of analysis and abstract algebra grows ever wider and more distinct, and students' need for a well-guided transition grows with it. For more than six years, the bestselling first edition of this classic text has helped them cross the mathematical bridge to more advanced studies in topics such as topology, abstract algebra, and real analysis. Carefully revised, expanded, and brought thoroughly up to date, the Elements of Advanced Mathematics, Second Edition now does the job even better, building the background, tools, and skills students need to meet the challenges of mathematical rigor, axiomatics, and proofs. New in the Second Edition: Expanded explanations of propositional, predicate, and first-order logic, especially valuable in theoretical computer science A chapter that explores the deeper properties of the real numbers, including topological issues and the Cantor set Fuller treatment of proof techniques with expanded discussions on induction, counting arguments, enumeration, and dissection Streamlined treatment of non-Euclidean geometry Discussions on partial orderings, total ordering, and well orderings that fit naturally into the context of relations More thorough treatment of the Axiom of Choice and its equivalents Additional material on Russell's paradox and related ideas Expanded treatment of group theory that helps students grasp the axiomatic method A wealth of added exercises

Geared toward upper-level undergraduates and graduate students, this treatment examines the basic paradoxes and history of set theory and advanced topics such as relations and functions, equipollence, more. 1960 edition.

This accessible textbook gives beginning undergraduate mathematics students a first exposure to introductory logic, proofs, sets, functions, number theory, relations, finite and infinite sets, and the foundations of analysis. The book provides students with a quick path to writing proofs and a practical collection of tools that they can use in later mathematics courses such as abstract algebra and analysis. The importance of the logical structure of a mathematical statement as a framework for finding a proof of that statement, and the proper use of variables, is an early and consistent theme used throughout the book.

This introductory graduate text covers modern mathematical logic from propositional, first-order and infinitary logic and Gödel's Incompleteness Theorems to extensive introductions to set theory, model theory and recursion (computability) theory. Based on the author's more than 35 years of teaching experience, the book develops students' intuition by presenting complex ideas in the simplest context for which they make sense. The book is appropriate for use as a classroom text, for self-study, and as a reference on the state of modern logic.

Studies in Logic and the Foundations of Mathematics: The Theory of Models covers the proceedings of the International Symposium on the Theory of Models, held at the University of California, Berkeley on June 25 to July 11, 1963. The book focuses on works devoted to the foundations of mathematics, generally known as "the theory of models." The selection first discusses the method of alternating chains, semantic construction of Lewis's systems S4 and S5, and continuous model theory. Concerns include ordered model theory, 2-valued model theory, semantics, sequents, axiomatization, formulas, axiomatic approach to hierarchies, alternating chains, and difference hierarchies. The text also ponders on Boolean notions extended to higher dimensions, elementary theories with models without automorphisms, and applications of the notions of forcing and generic sets. The manuscript takes a look at a hypothesis concerning the extension of finite relations and its verification for certain special cases, theories of functors and models, model-theoretic methods in the study of elementary logic, and extensions of relational structures. The text also reviews relatively categorical and normal theories, algebraic theories, categories, and functors, denumerable models of theories with extra predicates, and non-standard models for fragments of number theory. The selection is highly recommended for mathematicians and researchers interested in the theory of models.

Provability, Computability and Reflection

Dem Versuch, die These zu stützen, daß Logik und Mathematik eins seien, hat Russell mehrere Bücher gewidmet, unter anderem das dreibändige, gemeinsam mit A. N. Whitehead verfaßte Werk "Principia Mathematica" (1910-1913). Die "Einführung in die mathematische Philosophie" faßt die Ergebnisse dieser Untersuchungen zusammen, ohne Kenntnisse der mathematischen Symbolik vorauszusetzen. Sie ist zuweilen und mit Recht "eine bewundernswerte Exposition des Monumentalwerks Principia Mathematica" genannt worden; und sie ist zugleich etwas anderes, insofern sie eine relativ eigenständige Einführung in die Grundlagen der Mathematik und der Erkenntnistheorie darstellt.Das Buch entstand 1918 im Gefängnis von Brixton, wo Russell eine sechsmonatige Haftstrafe für seine pazifistische Tätigkeit während des 1. Weltkrieges absaß. Es ist sehr anregend zu lesen, wie beinahe alles, was Bertrand Russell geschrieben hat, und es ist ein Buch von der Art, wie es nur jemand wie Russell schreiben kann, wenn er im Gefängnis sitzt und keine Hilfsmittel hat und sich daher entschließt, allen technischen Ballast abzustreifen. Anders als die heute üblichen Texte im Bereich der Philosophie der Mathematik läßt Russell seine Leser immer an seinem Denken teilhaben, an seinen Vermutungen und Irrtümern und an der Begeisterung, die er bei der Beschäftigung mit seinem Gegenstand empfindet. Da er einer der herausragenden Protagonisten des modernen wissenschaftlichen Empirismus und einer der Begründer der heute dominierenden Philosophie der Mathematik ist, gewinnt man auf diese Weise aus seinen Schriften einen einzigartigen Einblick in die Wechselfälle und Ideen der erkenntnistheoretischen und logischen Diskussionen dieses Jahrhunderts.Die Ausgabe bietet eine revidierte Fassung der deutschen Übersetzung des in den 20er Jahren prominenten Mathematikers E. J. Gumbel sowie W. Gordon.

This text introduces students to basic techniques of writing proofs and acquaints them with some fundamental ideas. The authors assume that students using this text have already taken courses in which they developed the skill of using results and arguments that others have conceived. This text picks up where the others left off -- it develops the students' ability to think mathematically and to distinguish mathematical thinking from wishful thinking.

This gentle introduction to logic and model theory is based on a systematic use of three important games in logic: the semantic game; the Ehrenfeucht–Fraïssé game; and the model existence game. The third game has not been isolated in the literature before but it underlies the concepts of Beth tableaux and consistency properties. Jouko Väänänen shows that these games are closely related and in turn govern the three interrelated concepts of logic: truth, elementary equivalence and proof. All three methods are developed not only for first order logic but also for infinitary logic and generalized quantifiers. Along the way, the author also proves completeness theorems for many logics, including the cofinality quantifier logic of Shelah, a fully compact extension of first order logic. With over 500 exercises this book is ideal for graduate courses, covering the basic material as well as more advanced applications.