Discrete Mathematics: Proof Techniques and Mathematical Structures

Front Cover
World Scientific, 1999 - Computers - 469 pages
1 Review
This book offers an introduction to mathematical proofs and to the fundamentals of modern mathematics. No real prerequisites are needed other than a suitable level of mathematical maturity. The text is divided into two parts, the first of which constitutes the core of a one-semester course covering proofs, predicate calculus, set theory, elementary number theory, relations, and functions, and the second of which applies this material to a more advanced study of selected topics in pure mathematics, applied mathematics, and computer science, specifically cardinality, combinatorics, finite-state automata, and graphs. In both parts, deeper and more interesting material is treated in optional sections, and the text has been kept flexible by allowing many different possible courses or emphases based upon different paths through the volume.
 

What people are saying - Write a review

We haven't found any reviews in the usual places.

Contents

PART
1
Part В Methods of Proof
24
Predicate Calculus
45
Set Theory
93
Elementary Number Theory
151
Relations
179
Functions
259
Cardinality
313
Elements of Combinatorics
341
Languages and Finite State Automata
383
Graphs
425
Suggestions for Further Reading
455
Copyright

Other editions - View all

Common terms and phrases

References to this book

All Book Search results »

About the author (1999)

Penner-Univ of Southern California

Bibliographic information