Handbook of Analysis and Its Foundations is a self-contained and unified handbook on mathematical analysis and its foundations. Intended as a self-study guide for advanced undergraduates and beginning graduatestudents in mathematics and a reference for more advanced mathematicians, this highly readable book provides broader coverage than competing texts in the area. Handbook of Analysis and Its Foundations provides an introduction to a wide range of topics, including: algebra; topology; no...

Tough Test Questions? Missed Lectures? Not Rnough Time?Fortunately for you, there's Schaum's Outlines. More than 40 million students have trusted Schaum's to help them succeed in the classroom and on exams. Schaum's is the key to faster learning and higher grades in every subject. Each Outline presents all the essential course information in an easy-to-follow, topic-by-topic format. You also get hundreds of examples, solved problems, and practice exercises to test ...

Our intention in writing this book is to give an elementary introduction to number theory which does not demand a great deal of mathematical back ground or maturity from the reader, and which can be read and understood with no extra assistance. Our first three chapters are based almost entirely on A-level mathematics, while the next five require little else beyond some el ementary group theory. It is only in the last three chapters, where we treat more advanced topics, including recent dev...

The three volumes of A Course in Mathematical Analysis provide a full and detailed account of all those elements of real and complex analysis that an undergraduate mathematics student can expect to encounter in their first two or three years of study. Containing hundreds of exercises, examples and applications, these books will become an invaluable resource for both students and teachers. Volume 1 focuses on the analysis of real-valued functions of a real variable. This second volume goes ...

Logic is a branch of philosophy, mathematics and computer science. It studies the required methods to determine whether a statement is true, such as reasoning and computation.Proofs and Algorithms: Introduction to Logic and Computability is an introduction to the fundamental concepts of contemporary logic - those of a proof, a computable function, a model and a set. It presents a series of results, both positive and negative, - Church's undecidability theorem, Gödel’s inco...

Computability Theory: An Introduction to Recursion Theory provides a concise, comprehensive, and authoritative introduction to contemporary computability theory, techniques, and results. The basic concepts and techniques of computability theory are placed in their historical, philosophical and logical context. This presentation is characterized by an unusual breadth of coverage and the inclusion of advanced topics not to be found elsewhere in the literature at this level. The text includes...

Concrete Abstract Algebra develops the theory of abstract algebra from numbers to Gröbner bases, whilst taking in all the usual material of a traditional introductory course. In addition there is a rich supply of topics like cryptography, factoring algorithms for integers, quadratic residues, finite fields, factoring algorithms for polynomials and systems of non-linear equations. A special feature is that Gröbner bases do not appear as an isolated example. They are fully integrated as a su...

Data mining essentially relies on several mathematical disciplines, many of which are presented in this second edition of this book. Topics include partially ordered sets, combinatorics, general topology, metric spaces, linear spaces, graph theory. To motivate the reader a significant number of applications of these mathematical tools are included ranging from association rules, clustering algorithms, classification, data constraints, logical data analysis, etc. The book is intended as a r...

The representation theory of the symmetric groups is a classical topic that, since the pioneering work of Frobenius, Schur and Young, has grown into a huge body of theory, with many important connections to other areas of mathematics and physics. This self-contained book provides a detailed introduction to the subject, covering classical topics such as the Littlewood–Richardson rule and the Schur–Weyl duality. Importantly the authors also present many recent advances in the area, including...

An Introduction to Homological Algebra discusses the origins of algebraic topology. It also presents the study of homological algebra as a two-stage affair. First, one must learn the language of Ext and Tor and what it describes. Second, one must be able to compute these things, and often, this involves yet another language: spectral sequences. Homological algebra is an accessible subject to those who wish to learn it, and this book is the author's attempt to make it lovable. This book com...

Computability and Logic has become a classic because of its accessibility to students without a mathematical background and because it covers not simply the staple topics of an intermediate logic course, such as Godel's incompleteness theorems, but also a large number of optional topics, from Turing's theory of computability to Ramsey's theorem. This 2007 fifth edition has been thoroughly revised by John Burgess. Including a selection of exercises, adjusted for this edition, at the end of ...

A new approach to abstract algebra that eases student anxieties by building on fundamentals.Introduction to Abstract Algebra presents a breakthrough approach to teaching one of math's most intimidating concepts. Avoiding the pitfalls common in the standard textbooks, Benjamin Fine, Anthony M. Gaglione, and Gerhard Rosenberger set a pace that allows beginner-level students to follow the progression from familiar topics such as rings, numbers, and groups to ...