skip to content
How to prove it : a structured approach Preview this item
ClosePreview this item
Checking...

How to prove it : a structured approach

Author: Daniel J Velleman
Publisher: Cambridge ; New York : Cambridge University Press, 2006.
Edition/Format:   Book : English : 2nd edView all editions and formats
Database:WorldCat
Summary:
"This new edition of Velleman's successful text will prepare students to make the transition from solving problems to proving theorems by teaching 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  Read more...
Rating:

(not yet rated) 0 with reviews - Be the first.

Subjects
More like this

 

Find a copy online

Links to this item

Find a copy in the library

&AllPage.SpinnerRetrieving; Finding libraries that hold this item...

Details

Material Type: Internet resource
Document Type: Book, Internet Resource
All Authors / Contributors: Daniel J Velleman
ISBN: 0521861241 0521675995 9780521861243 9780521675994
OCLC Number: 62084309
Description: xiii, 384 p. : ill. ; 24 cm.
Contents: Introduction --
Sentential logic --
1.1 Deductive reasoning and logical connectives --
1.2 truth tables --
1.3 variables and sets --
1.4 operations on sets --
1.5 The conditional and biconditional connectives --
Quantificational logic --
2.1 Quantifiers --
2.2 Equivalences involving quantifiers --
2.3 More operations on sets --
Proofs --
3.1 proof strategies --
3.2 proofs involving negations and conditionals --
3.3 Proofs involving quantifiers --
3.4 Proofs involving conjunctions and biconditionals --
3.5 Proofs involving disjunctions --
3.6 Existence and uniqueness proofs --
3.7 More examples of proofs --
Relations --
4.1 Ordered pairs and cartesian products --
4.2 Relations --
4.3 More about relations --
4.4 Ordering relations --
4.5 Closures --
4.6 Equivalence relations --
Functions --
5.1 Functions --
5.2 One-to-one and onto --
5.3 Inverses of functions --
5.4 Images and inverse images: a research project --
Mathematical induction --
6.1 Proof by mathematical induction --
6.2 More examples --
6.3 Recursion --
6.4 Strong induction --
6.5 Closures again --
Infinite sets --
7.1 Equinumerous sets --
7.2 Countable and uncountable sets --
7.3 The cantor--Schroder--Bernstein theorem --
Appendix 1: Solutions to selected exercises --
Appendix 2: Proof designer --
Suggestions for further reading --
Summary for proof techniques --
Index.
Responsibility: Daniel J. Velleman.
More information:

Abstract:

This new edition of Dan Velleman's successful textbook contains over 200 new exercises, selected solutions, and an introduction to Proof Designer software.  Read more...

Reviews

Editorial reviews

Publisher Synopsis

'The book begins with the basic concepts of logic and theory ... These concepts are used as the basis for a step-by-step breakdown of the most important techniques used in constructing proofs. No Read more...

 
User-contributed reviews
Retrieving GoodReads reviews...
Retrieving DOGObooks reviews...

Tags

All user tags (2)

View most popular tags as: tag list | tag cloud

Similar Items

Related Subjects:(5)

User lists with this item (2)

Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

Linked Data


<http://www.worldcat.org/oclc/62084309>
library:oclcnum"62084309"
library:placeOfPublication
library:placeOfPublication
library:placeOfPublication
rdf:typeschema:Book
rdf:typeschema:MediaObject
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:bookEdition"2nd ed."
schema:creator
schema:datePublished"2006"
schema:description"Introduction -- Sentential logic -- 1.1 Deductive reasoning and logical connectives -- 1.2 truth tables -- 1.3 variables and sets -- 1.4 operations on sets -- 1.5 The conditional and biconditional connectives -- Quantificational logic -- 2.1 Quantifiers -- 2.2 Equivalences involving quantifiers -- 2.3 More operations on sets -- Proofs -- 3.1 proof strategies -- 3.2 proofs involving negations and conditionals -- 3.3 Proofs involving quantifiers -- 3.4 Proofs involving conjunctions and biconditionals -- 3.5 Proofs involving disjunctions -- 3.6 Existence and uniqueness proofs -- 3.7 More examples of proofs -- Relations -- 4.1 Ordered pairs and cartesian products -- 4.2 Relations -- 4.3 More about relations -- 4.4 Ordering relations -- 4.5 Closures -- 4.6 Equivalence relations -- Functions -- 5.1 Functions -- 5.2 One-to-one and onto -- 5.3 Inverses of functions -- 5.4 Images and inverse images: a research project -- Mathematical induction -- 6.1 Proof by mathematical induction -- 6.2 More examples -- 6.3 Recursion -- 6.4 Strong induction -- 6.5 Closures again -- Infinite sets -- 7.1 Equinumerous sets -- 7.2 Countable and uncountable sets -- 7.3 The cantor--Schroder--Bernstein theorem -- Appendix 1: Solutions to selected exercises -- Appendix 2: Proof designer -- Suggestions for further reading -- Summary for proof techniques -- Index."@en
schema:exampleOfWork<http://worldcat.org/entity/work/id/526534707>
schema:inLanguage"en"
schema:name"How to prove it : a structured approach"@en
schema:numberOfPages"384"
schema:publication
schema:publisher
schema:reviews
rdf:typeschema:Review
schema:itemReviewed<http://www.worldcat.org/oclc/62084309>
schema:reviewBody""This new edition of Velleman's successful text will prepare students to make the transition from solving problems to proving theorems by teaching 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. The author shows how complex proofs are built up from these smaller steps, using detailed "scratch work" sections to expose the machinery of proofs for the natural numbers, relations, functions, and infinite sets. To give students the opportunity to construct their own proofs, this new edition contains more than 200 new exercises, selected solutions, and an introduction to Proof Designer software." "No background beyond standard high school mathematics is assumed. This book will be useful to anyone interested in logic and proofs: computer scientists, philosophers, linguists, and of course mathematicians."--Jacket."
schema:workExample
schema:workExample
umbel:isLike<http://bnb.data.bl.uk/id/resource/GBA597006>
wdrs:describedby

Content-negotiable representations

Close Window

Please sign in to WorldCat 

Don't have an account? You can easily create a free account.