Essential Calculus
Essential Calculus

Author: James Stewart

Publisher: Cengage Learning

Published: 2012-02-10

Total Pages: 0

ISBN-13: 9781133112297

DOWNLOAD EBOOK

This book is for instructors who think that most calculus textbooks are too long. In writing the book, James Stewart asked himself: What is essential for a three-semester calculus course for scientists and engineers? ESSENTIAL CALCULUS, Second Edition, offers a concise approach to teaching calculus that focuses on major concepts, and supports those concepts with precise definitions, patient explanations, and carefully graded problems. The book is only 900 pages--two-thirds the size of Stewart's other calculus texts, and yet it contains almost all of the same topics. The author achieved this relative brevity primarily by condensing the exposition and by putting some of the features on the book's website, www.StewartCalculus.com. Despite the more compact size, the book has a modern flavor, covering technology and incorporating material to promote conceptual understanding, though not as prominently as in Stewart's other books. ESSENTIAL CALCULUS features the same attention to detail, eye for innovation, and meticulous accuracy that have made Stewart's textbooks the best-selling calculus texts in the world. Important Notice: Media content referenced within the product description or the product text may not be available in the ebook version.

Rudiments of Calculus
Rudiments of Calculus

Author: A. Arnold

Publisher: Elsevier

Published: 2001-02-07

Total Pages: 297

ISBN-13: 0080516459

DOWNLOAD EBOOK

This book presents what in our opinion constitutes the basis of the theory of the mu-calculus, considered as an algebraic system rather than a logic. We have wished to present the subject in a unified way, and in a form as general as possible. Therefore, our emphasis is on the generality of the fixed-point notation, and on the connections between mu-calculus, games, and automata, which we also explain in an algebraic way. This book should be accessible for graduate or advanced undergraduate students both in mathematics and computer science. We have designed this book especially for researchers and students interested in logic in computer science, comuter aided verification, and general aspects of automata theory. We have aimed at gathering in a single place the fundamental results of the theory, that are currently very scattered in the literature, and often hardly accessible for interested readers. The presentation is self-contained, except for the proof of the Mc-Naughton's Determinization Theorem (see, e.g., [97]. However, we suppose that the reader is already familiar with some basic automata theory and universal algebra. The references, credits, and suggestions for further reading are given at the end of each chapter.