A Logical Approach to Discrete Math

by ;
Format: Hardcover
Pub. Date: 1993-12-01
Publisher(s): Springer Verlag
List Price: $84.95

Buy Used

Usually Ships in 24-48 Hours
$63.71

Rent Textbook

Select for Price
There was a problem. Please try again later.

New Textbook

We're Sorry
Sold Out

eTextbook

We're Sorry
Not Available

How Marketplace Works:

  • This item is offered by an independent seller and not shipped from our warehouse
  • Item details like edition and cover design may differ from our description; see seller's comments before ordering.
  • Sellers much confirm and ship within two business days; otherwise, the order will be cancelled and refunded.
  • Marketplace purchases cannot be returned to eCampus.com. Contact the seller directly for inquiries; if no response within two days, contact customer service.
  • Additional shipping costs apply to Marketplace purchases. Review shipping costs at checkout.

Summary

This text attempts to change the way logic and discrete math are taught in computer science and mathematics. While many books treat logic simply as another topic of study, this book's uniqueness is its willingness to take it one step further. In the book, logic is treated as a basic tool, to be applied in essentially every other area. "This is a rather extraordinary book, and deserves to be read by everyone involved in computer science and - perhaps more importantly - software engineering. I recommend it highly. The book will be of value not only to beginning students, but also to hardened programmers with many years of experience - in Fortran, Cobol, C, C++, or whatever. If the book is taken seriously, the rigor that it unfolds and the clarity of its concepts could have a significant impact on the way in which software is conceived and developed." -Peter G. Neumann-

Table of Contents

Preface
Using Mathematicsp. 1
Textual Substitution, Equality, and Assignmentp. 7
Boolean Expressionsp. 25
Propositional Calculusp. 41
Relaxing the Proof Stylep. 69
Applications of Propositional Calculusp. 83
Hilbert-style Proofsp. 109
Formal Logicp. 125
Quantificationp. 139
Predicate Calculusp. 157
Predicates and Programmingp. 179
A Theory of Setsp. 195
Mathematical Inductionp. 217
A Theory of Sequencesp. 251
Relations and Functionsp. 265
A Theory of Integersp. 303
Combinatorial Analysisp. 337
Recurrence Relationsp. 363
Modern Algebrap. 387
A Theory of Graphsp. 423
Infinite Setsp. 461
Referencesp. 473
Indexp. 477
Theorems of the propositional and predicate calculip. 503
Table of Contents provided by Blackwell. All Rights Reserved.

An electronic version of this book is available through VitalSource.

This book is viewable on PC, Mac, iPhone, iPad, iPod Touch, and most smartphones.

By purchasing, you will be able to view this book online, as well as download it, for the chosen number of days.

Digital License

You are licensing a digital product for a set duration. Durations are set forth in the product description, with "Lifetime" typically meaning five (5) years of online access and permanent download to a supported device. All licenses are non-transferable.

More details can be found here.

A downloadable version of this book is available through the eCampus Reader or compatible Adobe readers.

Applications are available on iOS, Android, PC, Mac, and Windows Mobile platforms.

Please view the compatibility matrix prior to purchase.