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.

FOAM. This acronym has been used for over ?fty years at Rensselaer to designate an upper-division course entitled, Foundations of Applied Ma- ematics. This course was started by George Handelman in 1956, when he came to Rensselaer from the Carnegie Institute of Technology. His objective was to closely integrate mathematical and physical reasoning, and in the p- cess enable students to obtain a qualitative understanding of the world we live in. FOAM was soon taken over by a young faculty member, Lee Segel. About this time a similar course, Introduction to Applied Mathematics, was introduced by Chia-Ch’iao Lin at the Massachusetts Institute of Technology. Together Lin and Segel, with help from Handelman, produced one of the landmark textbooks in applied mathematics, Mathematics Applied to - terministic Problems in the Natural Sciences. This was originally published in 1974, and republished in 1988 by the Society for Industrial and Applied Mathematics, in their Classics Series. This textbook comes from the author teaching FOAM over the last few years. In this sense, it is an updated version of the Lin and Segel textbook.

Ideal for students intending to specialize in the topic. Part I discusses traditional and symbolic logic. Part II explores the foundations of mathematics. Part III focuses on the philosophy of mathematics.

The two main themes of this book, logic and complexity, are both essential for understanding the main problems about the foundations of mathematics. Logical Foundations of Mathematics and Computational Complexity covers a broad spectrum of results in logic and set theory that are relevant to the foundations, as well as the results in computational complexity and the interdisciplinary area of proof complexity. The author presents his ideas on how these areas are connected, what are the most fundamental problems and how they should be approached. In particular, he argues that complexity is as important for foundations as are the more traditional concepts of computability and provability. Emphasis is on explaining the essence of concepts and the ideas of proofs, rather than presenting precise formal statements and full proofs. Each section starts with concepts and results easily explained, and gradually proceeds to more difficult ones. The notes after each section present some formal definitions, theorems and proofs. Logical Foundations of Mathematics and Computational Complexity is aimed at graduate students of all fields of mathematics who are interested in logic, complexity and foundations. It will also be of interest for both physicists and philosophers who are curious to learn the basics of logic and complexity theory.

Concise volume for general students by prominent philosopher and mathematician explains what math is and does, and how mathematicians do it. "Lucid and cogent ... should delight you." — The New York Times. 1911 edition.

This book provides an introduction to axiomatic set theory and descriptive set theory. It is written for the upper level undergraduate or beginning graduate students to help them prepare for advanced study in set theory and mathematical logic as well as other areas of mathematics, such as analysis, topology, and algebra.The book is designed as a flexible and accessible text for a one-semester introductory course in set theory, where the existing alternatives may be more demanding or specialized. Readers will learn the universally accepted basis of the field, with several popular topics added as an option. Pointers to more advanced study are scattered throughout the text.

This book is intended for use in a rigorous introductory PhD level course in econometrics.