How to Prove It
A Structured Approach
3rd Edition
 Author: Daniel J. Velleman, Amherst College, Massachusetts
 Date Published: July 2019
 availability: Available
 format: Paperback
 isbn: 9781108439534
Paperback

Proofs play a central role in advanced mathematics and theoretical computer science, yet many students struggle the first time they take a course in which proofs play a significant role. This bestselling text's third edition helps students transition from solving problems to proving theorems by teaching them the techniques needed to read and write proofs. Featuring over 150 new exercises and a new chapter on number theory, this new edition introduces students to the world of advanced mathematics through the mastery of 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 an analysis of techniques that can be used to build up complex proofs step by step, using detailed 'scratch work' sections to expose the machinery of proofs about numbers, sets, relations, and functions. Assuming no background beyond standard high school mathematics, this book will be useful to anyone interested in logic and proofs: computer scientists, philosophers, linguists, and, of course, mathematicians.
Read more Perfect for selfstudy, an introduction to proofs course, or as a supplementary text for a discrete mathematics course or foundations of computing course
 Systematic and thorough, showing how several techniques can be combined to construct a complex proof
 Covers logic, set theory, relations, functions, and cardinality
Reviews & endorsements
'Not only does this book help students learn how to prove results, it highlights why we care so much. It starts in the introduction with some simple conjectures and gathering data, quickly disproving the first but amassing support for the second. Will that pattern persist? How can these observations lead us to a proof? The book is engagingly written, and covers  in clear and great detail  many proof techniques. There is a wealth of good exercises at various levels. I've taught problem solving before (at The Ohio State University and Williams College), and this book has been a great addition to the resources I recommend to my students.' Steven J. Miller, Williams College, Massachusetts
See more reviews'This book is my goto resource for students struggling with how to write mathematical proofs. Beyond its plentiful examples, Velleman clearly lays out the techniques and principles so often glossed over in other texts.' Rafael Frongillo, University of Colorado, Boulder
'I've been using this book religiously for the last eight years. It builds a strong foundation in proof writing and creates the axiomatic framework for future higherlevel mathematics courses. Even when teaching more advanced courses, I recommend students to read chapter 3 (Proofs) since it is, in my opinion, the best written exposition of proof writing techniques and strategies. This third edition brings a new chapter (Number Theory), which gives the instructor a few more topics to choose from when teaching a fundamental course in mathematics. I will keep using it and recommending it to everyone, professors and students alike.' Mihai Bailesteanu, Central Connecticut State University
'Professor Velleman sets himself the difficult task of bridging the gap between algorithmic and proofbased mathematics. By focusing on the basic ideas, he succeeded admirably. Many similar books are available, but none are more treasured by beginning students. In the Third Edition, the constant pursuit of excellence is further reinforced.' Taje Ramsamujh, Florida International University
'Proofs are central to mathematical development. They are the tools used by mathematicians to establish and communicate their results. The developing mathematician often learns what constitutes a proof and how to present it by osmosis. How to Prove It aims at changing that. It oﬀers a systematic introduction to the development, structuring, and presentation of logical mathematical arguments, i.e. proofs. The approach is based on the language of ﬁrstorder logic and supported by proof techniques in the style of natural deduction. The art of proving is exercised with naive set theory and elementary number theory throughout the book. As such, it will prove invaluable to ﬁrstyear undergraduate students in mathematics and computer science.' Marcelo Fiore, University of Cambridge
Customer reviews
Not yet reviewed
Be the first to review
Review was not posted due to profanity
×Product details
 Edition: 3rd Edition
 Date Published: July 2019
 format: Paperback
 isbn: 9781108439534
 length: 468 pages
 dimensions: 227 x 153 x 23 mm
 weight: 0.76kg
 contains: 47 b/w illus.
 availability: Available
Table of Contents
1. Sentential logic
2. Quantificational logic
3. Proofs
4. Relations
5. Functions
6. Mathematical induction
7. Number theory
8. Infinite sets.
Find resources associated with this title
Type Name Unlocked * Format Size Showing of
This title is supported by one or more locked resources. Access to locked resources is granted exclusively by Cambridge University Press to lecturers whose faculty status has been verified. To gain access to locked resources, lecturers should sign in to or register for a Cambridge user account.
Please use locked resources responsibly and exercise your professional discretion when choosing how you share these materials with your students. Other lecturers may wish to use locked resources for assessment purposes and their usefulness is undermined when the source files (for example, solution manuals or test banks) are shared online or via social networks.
Supplementary resources are subject to copyright. Lecturers are permitted to view, print or download these resources for use in their teaching, but may not change them or use them for commercial gain.
If you are having problems accessing these resources please contact lecturers@cambridge.org.
Sorry, this resource is locked
Please register or sign in to request access. If you are having problems accessing these resources please email lecturers@cambridge.org
Register Sign in» Proceed