Geared to preparing students to make the transition from solving problems to proving theorems, this text teaches them the techniques needed to read and write proofs. The book begins with the basic concepts of logic and set theory, to familiarize students with the language of mathematics and how it is interpreted. These concepts are used as the basis for a step-by-step breakdown of the most important techniques used in constructing proofs. To help students construct their own proofs, this new edition contains over 200 new exercises, selected solutions, and an introduction to Proof Designer software. No background beyond standard high school mathematics is assumed. Previous Edition Hb (1994) 0-521-44116-1 Previous Edition Pb (1994) 0-521-44663-5Read more
- Systematic and thorough, shows how several techniques can be combined to construct a complex proof
- Selected solutions and hints now provided, plus over 200 exercises some using Proof Designer software to help students learn to construct their own proofs
- Covers logic, set theory, relations, functions and cardinality
Reviews & endorsements
"The prose is clear and cogent ... the exercises are plentiful and are pitched at the right level.... I recommend this book very highly!"
MAA ReviewsSee more reviews
"The book provides a valuable introduction to the nuts and bolts of mathematical proofs in general."
"This is a good book, and an exceptionally good mathematics book. Thorough and clear explanations, examples, and (especially) exercised with complete solutions all contribute to make this an excellent choice for teaching yourself, or a class, about writing proofs."
Brent Smith, SIGACT News
Not yet reviewed
Be the first to review
Review was not posted due to profanity×
- Edition: 2nd Edition
- Date Published: January 2006
- format: Paperback
- isbn: 9780521675994
- length: 398 pages
- dimensions: 229 x 152 x 22 mm
- weight: 0.53kg
- contains: 10 tables 536 exercises
- availability: In stock
Table of Contents
1. Sentential logic
2. Quantificational logic
6. Mathematical induction
7. Infinite sets.
Sorry, this resource is locked
Please register or sign in to request access. If you are having problems accessing these resources please email firstname.lastname@example.orgRegister Sign in
You are now leaving the Cambridge University Press website. Your eBook purchase and download will be completed by our partner www.ebooks.com. Please see the permission section of the www.ebooks.com catalogue page for details of the print & copy limits on our eBooks.Continue ×