This text deals with three basic techniques for constructing models of Zermelo-Fraenkel set theory: relative constructibility, Cohen's forcing, and Scott-Solovay's method of Boolean valued models. Our main concern will be the development of a unified theory that encompasses these techniques in one comprehensive framework. Consequently we will focus on certain funda mental and intrinsic relations between these methods of model construction. Extensive applications will not be treated here. This text is a continuation of our book, "I ntroduction to Axiomatic Set Theory," Springer-Verlag, 1971; indeed the two texts were originally planned as a single volume. The content of this volume is essentially that of a course taught by the first author at the University of Illinois in the spring of 1969. From the first author's lectures, a first draft was prepared by Klaus Gloede with the assistance of Donald Pelletier and the second author. This draft was then rcvised by the first author assisted by Hisao Tanaka. The introductory material was prepared by the second author who was also responsible for the general style of exposition throughout the text. We have inc1uded in the introductory material al1 the results from Boolean algebra and topology that we need. When notation from our first volume is introduced, it is accompanied with a deflnition, usually in a footnote. Consequently a reader who is familiar with elementary set theory will find this text quite self-contained.

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.

In 1963, the first author introduced a course in set theory at the University of Illinois whose main objectives were to cover Godel's work on the con sistency of the Axiom of Choice (AC) and the Generalized Continuum Hypothesis (GCH), and Cohen's work on the independence of the AC and the GCH. Notes taken in 1963 by the second author were taught by him in 1966, revised extensively, and are presented here as an introduction to axiomatic set theory. Texts in set theory frequently develop the subject rapidly moving from key result to key result and suppressing many details. Advocates of the fast development claim at least two advantages. First, key results are high lighted, and second, the student who wishes to master the subject is com pelled to develop the detail on his own. However, an instructor using a "fast development" text must devote much class time to assisting his students in their efforts to bridge gaps in the text.

Mathematical logic grew out of philosophical questions regarding the foundations of mathematics, but logic has now outgrown its philosophical roots, and has become an integral part of mathematics in general. This book is designed for students who plan to specialize in logic, as well as for those who are interested in the applications of logic to other areas of mathematics. Used as a text, it could form the basis of a beginning graduate-level course. There are three main chapters: Set Theory, Model Theory, and Recursion Theory. The Set Theory chapter describes the set-theoretic foundations of all of mathematics, based on the ZFC axioms. It also covers technical results about the Axiom of Choice, well-orderings, and the theory of uncountable cardinals. The Model Theory chapter discusses predicate logic and formal proofs, and covers the Completeness, Compactness, and Lowenheim-Skolem Theorems, elementary submodels, model completeness, and applications to algebra. This chapter also continues the foundational issues begun in the set theory chapter. Mathematics can now be viewed as formal proofs from ZFC. Also, model theory leads to models of set theory. This includes a discussion of absoluteness, and an analysis of models such as H( ) and R( ). The Recursion Theory chapter develops some basic facts about computable functions, and uses them to prove a number of results of foundational importance; in particular, Church's theorem on the undecidability of logical consequence, the incompleteness theorems of Godel, and Tarski's theorem on the non-definability of truth.

This book presents the classic relative consistency proofs in set theory that are obtained by the device of 'inner models'. Three examples of such models are investigated in Chapters VI, VII, and VIII; the most important of these, the class of constructible sets, leads to G6del's result that the axiom of choice and the continuum hypothesis are consistent with the rest of set theory [1]I. The text thus constitutes an introduction to the results of P. Cohen concerning the independence of these axioms [2], and to many other relative consistency proofs obtained later by Cohen's methods. Chapters I and II introduce the axioms of set theory, and develop such parts of the theory as are indispensable for every relative consistency proof; the method of recursive definition on the ordinals being an import ant case in point. Although, more or less deliberately, no proofs have been omitted, the development here will be found to require of the reader a certain facility in naive set theory and in the axiomatic method, such e as should be achieved, for example, in first year graduate work (2 cycle de mathernatiques).