Wadsworth & Brooks/Cole Mathematics Series – serie

The reader is assumed to know the elementary part of complex funCtion theory, general topology, integration, and linear spaces. All the needed information is contained in a usual first-year graduate course on analysis. These prerequisites are modest but essential. To be sure there is a big gap between learning the Banach-Steinhaus theorem, for example, and applying it to a real problem. Filling that gap is one of the objectives of this book. It is a natural objective, because integration theory and functional analysis to a great extent developed in response to the problems of Fourier series! The exposition has been condensed somewhat by relegating proofs of some technical points to the problem sets. Other problems give results that are needed in subsequent sections; and many problems simply present interesting results of the subject that are not otherwise covered. Problems range in difficulty from very simple to very hard. The system of numeration is simple: Sec. 3. 2 is the second section of Chapter 3. The second section of the current chapter is Sec. 2. Formula (3. 2) is the second formula of Sec. 3, of the current chapter unless otherwise mentioned. With pleasure I record the debt to my notes from a course on Real Variables given by R. Salem in 1945. I wish to thank R. Fefferman, Y. Katznelson, and A. 6 Cairbre for sympathetic criti­ cism of the manuscript. Mr. Carl Harris of the Addison-Wesley Publishing Company has been most helpful in bringing the book to publication.

"…the text is user friendly to the topics it considers and should be very accessible…Instructors and students of statistical measure theoretic courses will appreciate the numerous informative exercises; helpful hints or solution outlines are given with many of the problems. All in all, the text should make a useful reference for professionals and students."—The Journal of the American Statistical Association

This is a compact mtroduction to some of the pnncipal tOpICS of mathematical logic . In the belief that beginners should be exposed to the most natural and easiest proofs, I have used free-swinging set-theoretic methods. The significance of a demand for constructive proofs can be evaluated only after a certain amount of experience with mathematical logic has been obtained. If we are to be expelled from "Cantor's paradise" (as nonconstructive set theory was called by Hilbert), at least we should know what we are missing. The major changes in this new edition are the following. (1) In Chapter 5, Effective Computability, Turing-computabIlity IS now the central notion, and diagrams (flow-charts) are used to construct Turing machines. There are also treatments of Markov algorithms, Herbrand-Godel-computability, register machines, and random access machines. Recursion theory is gone into a little more deeply, including the s-m-n theorem, the recursion theorem, and Rice's Theorem. (2) The proofs of the Incompleteness Theorems are now based upon the Diagonalization Lemma. Lob's Theorem and its connection with Godel's Second Theorem are also studied. (3) In Chapter 2, Quantification Theory, Henkin's proof of the completeness theorem has been postponed until the reader has gained more experience in proof techniques. The exposition of the proof itself has been improved by breaking it down into smaller pieces and using the notion of a scapegoat theory. There is also an entirely new section on semantic trees.