The roots of Borel sets go back to the work of Baire [8]. He was trying to come to grips with the abstract notion of a function introduced by Dirich let and Riemann. According to them, a function was to be an arbitrary correspondence between objects without giving any method or procedure by which the correspondence could be established. Since all the specific functions that one studied were determined by simple analytic expressions, Baire delineated those functions that can be constructed starting from con tinuous functions and iterating the operation 0/ pointwise limit on a se quence 0/ functions. These functions are now known as Baire functions. Lebesgue [65] and Borel [19] continued this work. In [19], Borel sets were defined for the first time. In his paper, Lebesgue made a systematic study of Baire functions and introduced many tools and techniques that are used even today. Among other results, he showed that Borel functions coincide with Baire functions. The study of Borel sets got an impetus from an error in Lebesgue's paper, which was spotted by Souslin. Lebesgue was trying to prove the following: Suppose / : )R2 -- R is a Baire function such that for every x, the equation /(x,y) = 0 has a. unique solution. Then y as a function 0/ x defined by the above equation is Baire.

A thorough introduction to Borel sets and measurable selections, acting as a stepping stone to descriptive set theory by presenting such important techniques as universal sets, prewellordering, scales, etc. It contains significant applications to other branches of mathematics and serves as a self-contained reference accessible by mathematicians in many different disciplines. Written in an easily understandable style, and using only naive set theory, general topology, analysis, and algebra, it is thus well suited for graduates exploring areas of mathematics for their research and for those requiring Borel sets and measurable selections in their work.

Descriptive set theory has been one of the main areas of research in set theory for almost a century. This text presents a largely balanced approach to the subject, which combines many elements of the different traditions. It includes a wide variety of examples, more than 400 exercises, and applications, in order to illustrate the general concepts and results of the theory.

These notes develop the theory of descriptive sets, leading up to a new proof of Louveau's separation theorem for analytic sets. A first course in mathematical logic and set theory is assumed, making this book suitable for advanced students and researchers.

Written by an expert on the topic and experienced lecturer, this textbook provides an elegant, self-contained introduction to functional analysis, including several advanced topics and applications to harmonic analysis. Starting from basic topics before proceeding to more advanced material, the book covers measure and integration theory, classical Banach and Hilbert space theory, spectral theory for bounded operators, fixed point theory, Schauder bases, the Riesz-Thorin interpolation theorem for operators, as well as topics in duality and convexity theory. Aimed at advanced undergraduate and graduate students, this book is suitable for both introductory and more advanced courses in functional analysis. Including over 1500 exercises of varying difficulty and various motivational and historical remarks, the book can be used for self-study and alongside lecture courses.

This is a graduate text introducing the fundamentals of measure theory and integration theory, which is the foundation of modern real analysis. The text focuses first on the concrete setting of Lebesgue measure and the Lebesgue integral (which in turn is motivated by the more classical concepts of Jordan measure and the Riemann integral), before moving on to abstract measure and integration theory, including the standard convergence theorems, Fubini's theorem, and the Carathéodory extension theorem. Classical differentiation theorems, such as the Lebesgue and Rademacher differentiation theorems, are also covered, as are connections with probability theory. The material is intended to cover a quarter or semester's worth of material for a first graduate course in real analysis. There is an emphasis in the text on tying together the abstract and the concrete sides of the subject, using the latter to illustrate and motivate the former. The central role of key principles (such as Littlewood's three principles) as providing guiding intuition to the subject is also emphasized. There are a large number of exercises throughout that develop key aspects of the theory, and are thus an integral component of the text. As a supplementary section, a discussion of general problem-solving strategies in analysis is also given. The last three sections discuss optional topics related to the main matter of the book.

This is a short, modern, and motivated introduction to mathematical logic for upper undergraduate and beginning graduate students in mathematics and computer science. Any mathematician who is interested in getting acquainted with logic and would like to learn Gödel’s incompleteness theorems should find this book particularly useful. The treatment is thoroughly mathematical and prepares students to branch out in several areas of mathematics related to foundations and computability, such as logic, axiomatic set theory, model theory, recursion theory, and computability. In this new edition, many small and large changes have been made throughout the text. The main purpose of this new edition is to provide a healthy first introduction to model theory, which is a very important branch of logic. Topics in the new chapter include ultraproduct of models, elimination of quantifiers, types, applications of types to model theory, and applications to algebra, number theory and geometry. Some proofs, such as the proof of the very important completeness theorem, have been completely rewritten in a more clear and concise manner. The new edition also introduces new topics, such as the notion of elementary class of structures, elementary diagrams, partial elementary maps, homogeneous structures, definability, and many more.

Set theory is the mathematics of infinity and part of the core curriculum for mathematics majors. This book blends theory and connections with other parts of mathematics so that readers can understand the place of set theory within the wider context. Beginning with the theoretical fundamentals, the author proceeds to illustrate applications to topology, analysis and combinatorics, as well as to pure set theory. Concepts such as Boolean algebras, trees, games, dense linear orderings, ideals, filters and club and stationary sets are also developed. Pitched specifically at undergraduate students, the approach is neither esoteric nor encyclopedic. The author, an experienced instructor, includes motivating examples and over 100 exercises designed for homework assignments, reviews and exams. It is appropriate for undergraduates as a course textbook or for self-study. Graduate students and researchers will also find it useful as a refresher or to solidify their understanding of basic set theory.

This book contains about 500 exercises consisting mostly of special cases and examples, second thoughts and alternative arguments, natural extensions, and some novel departures. With a few obvious exceptions they are neither profound nor trivial, and hints and comments are appended to many of them. If they tend to be somewhat inbred, at least they are relevant to the text and should help in its digestion. As a bold venture I have marked a few of them with a * to indicate a "must", although no rigid standard of selection has been used. Some of these are needed in the book, but in any case the reader's study of the text will be more complete after he has tried at least those problems.