1  5
Number of results to display per page
 Solow, Daniel, author.
 Sixth edition.  Hoboken, New Jersey : John Wiley & Sons, Inc., [2014]
 Description
 Book — xiv, 319 pages : illustrations ; 23 cm
 Summary

 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 ForwardBackward 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)
(source: Nielsen Book Data) 9781118164020 20181008
 Online
Engineering Library (Terman)
Engineering Library (Terman)  Status 

On reserve: Ask at circulation desk  
QA9 .S577 2014  Unknown 2hour loan 
QA9 .S577 2014  Unknown 2hour loan 
CS10301
 Course
 CS10301  Mathematical Foundations of Computing
 Instructor(s)
 Lee, Cynthia Bailey
 Sipser, Michael.
 3rd ed.  Boston, MA : Cengage Learning, c2013.
 Description
 Book — xxii, 458 p. : ill ; 24 cm.
 Summary

 1. Regular languages
 2. Contextfree languages
 3. The ChurchTuring thesis
 4. Decidability
 5. Reducibility
 6. Advanced topics in computability theory
 7. Time complexity
 8. Space complexity
 9. Intractability
 10. Advanced topics in complexity theory.
 Online
Engineering Library (Terman)
Engineering Library (Terman)  Status 

On reserve: Ask at circulation desk  
QA267 .S56 2013  Unknown 2hour loan 
QA267 .S56 2013  Unknown 2hour loan 
CS10301
 Course
 CS10301  Mathematical Foundations of Computing
 Instructor(s)
 Lee, Cynthia Bailey
 Solow, Daniel.
 5th ed.  Hoboken, NJ : Wiley, c2010.
 Description
 Book — xviii, 301 p. : ill. ; 23 cm.
 Summary

 The Truth of It All. The ForwardBackward 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)
(source: Nielsen Book Data) 9780470392164 20160528
 Online
Engineering Library (Terman)
Engineering Library (Terman)  Status 

On reserve: Ask at circulation desk  
QA9 .S577 2010  Unknown 1day loan 
CS10301
 Course
 CS10301  Mathematical Foundations of Computing
 Instructor(s)
 Lee, Cynthia Bailey
 Sipser, Michael.
 2nd ed.  Boston : Thomson Course Technology, c2006.
 Description
 Book — xix, 431 p. : ill. ; 25 cm.
 Summary

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
 Online
Engineering Library (Terman)
Engineering Library (Terman)  Status 

On reserve: Ask at circulation desk  
QA267 .S56 2006  Unknown 1day loan 
CS10301
 Course
 CS10301  Mathematical Foundations of Computing
 Instructor(s)
 Lee, Cynthia Bailey
 Solow, Daniel.
 4th ed.  Hoboken, N.J. : John Wiley, c2005.
 Description
 Book — 269 p. : ill. ; 25 cm.
 Summary

 Foreword.Preface to the Student.Preface to the Instructor.Acknowledgments.1. The Truth of It All.2. The ForwardBackward 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)
(source: Nielsen Book Data) 9780471680581 20160528
 Online
Engineering Library (Terman)
Engineering Library (Terman)  Status 

On reserve: Ask at circulation desk  
QA9 .S577 2005  Unknown 1day loan 
CS10301
 Course
 CS10301  Mathematical Foundations of Computing
 Instructor(s)
 Lee, Cynthia Bailey