%{search_type} search results

5 catalog results

RSS feed for this result
Book
xiv, 319 pages : illustrations ; 23 cm
  • Foreword xi Preface to the Student xiii Preface to the Instructor xv Acknowledgments xviii Part I Proofs 1 Chapter 1: The Truth of It All 1 2 The Forward-Backward Method 9 3 On Definitions and Mathematical Terminology 25 4 Quantifiers I: The Construction Method 41 5 Quantifiers II: The Choose Method 53 6 Quantifiers III: Specialization 69 7 Quantifiers IV: Nested Quantifiers 81 8 Nots of Nots Lead to Knots 93 9 The Contradiction Method 101 10 The Contrapositive Method 115 11 The Uniqueness Methods 125 12 Induction 133 13 The Either/Or Methods 145 14 The Max/Min Methods 155 15 Summary 163 Part II Other Mathematical Thinking Processes 16 Generalization 179 17 Creating Mathematical Definitions 197 18 Axiomatic Systems 219 Appendix A Examples of Proofs from Discrete Mathematics 237 Appendix B Examples of Proofs from Linear Algebra 251 Appendix C Examples of Proofs from Modern Algebra 269 Appendix D Examples of Proofs from Real Analysis 287 Solutions to Selected Exercises 305 Glossary 357 References 367 Index 369.
  • (source: Nielsen Book Data)9781118164020 20160613
Solow, "How to Read and Do Proofs, " provides a systematicapproach for teaching students how to read, think about, understand, and create proofs. It develops a method forcommunicating proofs, categorizing, identifying, and explaining (atthe student's level) the various techniques that are usedrepeatedly in virtually all proofs. These clear, conciseexplanations promote understanding of the theoretical mathematicsbehind abstract mathematics and give students a greater opportunityto succeed in advanced courses. Along with the addition of threenew chapters, a "Part 2" is added to the SixthEdition, which focuses on the mathematical thought processesassociated with proofs. The teaching of this foregoingthinking processes reduces the time needed for readers tolearn advanced mathematics courses while simultaneously increasingtheir depth of understanding so as to enable them to usemathematics more effectively as a problem-solving tool in theirpersonal and professional lives.
(source: Nielsen Book Data)9781118164020 20160613
Engineering Library (Terman)
CS-103-01
Book
xxii, 458 p. : ill ; 24 cm.
  • 1. Regular languages
  • 2. Context-free languages
  • 3. The Church-Turing thesis
  • 4. Decidability
  • 5. Reducibility
  • 6. Advanced topics in computability theory
  • 7. Time complexity
  • 8. Space complexity
  • 9. Interactibility
  • 10. Advanced topics in complexity theory.
Engineering Library (Terman)
CS-103-01
Book
xviii, 301 p. : ill. ; 23 cm.
  • The Truth of It All. The Forward-Backward Method On Definitions and Mathematical Terminology. Quantifiers I: The Construction Method. Quantifiers II: The Choose Method. Quantifiers III: Specialization. Quantifiers IV: Nested Quantifiers. Nots of Nots Lead to Knots. The Contradiction Method. The Contrapositive Method. Induction. The Either/Or Methods. The Max/Min Methods. Summary. Appendix A: Examples of Proofs from Discrete Mathematics. Appendix B: Examples of Proofs from Linear Algebra. Appendix C: Examples of Proofs from Modern Algebra. Appendix D: Examples of Proofs from Real Analysis. Solutions to Selected Exercises. Glossary. References. Index.
  • (source: Nielsen Book Data)9780470392164 20160528
When engineers, computer scientists, and economists need to learn how to read, think about, and create proofs, they turn to Solow. In order to make the material more relevant, the exercises in each chapter have been revised and expanded. New and more complete discussions are included on how to use a previously-proved proposition in both the forward and backward processes. The fifth edition also presents new, self-contained chapters on uniqueness, induction, either/or, and max/min methods. Several final examples of how to read and do proofs are included in the final chapter to reinforce the reader's knowledge of the various proof techniques.
(source: Nielsen Book Data)9780470392164 20160528
Engineering Library (Terman)
CS-103-01
Book
xix, 431 p. : ill. ; 25 cm.
This market leading text on computational theory provides a mathematical treatment of computer science theory designed around theorems and proofs.
(source: Nielsen Book Data)9780534950972 20160528
Engineering Library (Terman)
CS-103-01
Book
269 p. : ill. ; 25 cm.
  • Foreword.Preface to the Student.Preface to the Instructor.Acknowledgments.1. The Truth of It All.2. The Forward-Backward Method.3. On Definitions and Mathematical Terminology.4. Quantifiers I: The Construction Method.5. Quantifiers II: The Choose Method.6. Quantifiers III: Specialization.7. Quantifiers IV: Nested Quantifiers.8. Nots of Nots Lead to Knots.9. The Contradiction Method.10. The Contrapositive Method.11. Uniqueness Methods and Induction.12. Either/or and Max/Min Methods.13. Summary.Appendix A: Examples of Proofs from Discrete Mathematics.Appendix B: Examples of Proofs from Linear Algebra.Appendix C: Examples of Proofs from Modern Algebra.Appendix D: Examples of Proofs from Real Analysis.Solutions to Select Exercises.Glossary.References.Index.
  • (source: Nielsen Book Data)9780471680581 20160528
An easy-to-use guide that shows how to read, understand, and do proofs. Shows how any proof can be understood as a sequence of techniques. Covers the full range of techniques used in proofs, such as the contrapositive, induction, and proof by contradiction. Explains how to identify which techniques are used and how they are applied in the specific problem. Illustrates how to read written proofs with many step-by-step examples. Includes new, expanded appendices related to discrete mathematics, linear algebra, modern algebra and real analysis.
(source: Nielsen Book Data)9780471680581 20160528
Engineering Library (Terman)
CS-103-01