Discrete Mathematics : Proofs, Structures and Applications, Third Edition
β Scribed by Garnier, Rowan; Taylor, John
- Publisher
- CRC Press
- Year
- 2009
- Tongue
- English
- Leaves
- 847
- Edition
- 3rd ed
- Category
- Library
No coin nor oath required. For personal study only.
β¦ Synopsis
Logic Propositions and Truth Values Logical Connectives and Truth Tables Tautologies and Contradictions Logical Equivalence and Logical Implication The Algebra of Propositions Arguments Formal Proof of the Validity of Arguments Predicate Logic Arguments in Predicate Logic Mathematical Proof The Nature of Proof Axioms and Axiom Systems Methods of Proof Mathematical Induction Sets Sets and MembershipSubsetsOperations Read more...
Abstract: Logic Propositions and Truth Values Logical Connectives and Truth Tables Tautologies and Contradictions Logical Equivalence and Logical Implication The Algebra of Propositions Arguments Formal Proof of the Validity of Arguments Predicate Logic Arguments in Predicate Logic Mathematical Proof The Nature of Proof Axioms and Axiom Systems Methods of Proof Mathematical Induction Sets Sets and MembershipSubsetsOperations on SetsCounting TechniquesThe Algebra of Sets Families of Sets The Cartesian Product Types and Typed Set TheoryRelations Relations and Their Representations Properties of Relations
β¦ Table of Contents
Content: Cover
Title
Copyright
Contents
Preface to the Third Edition
Preface to the Second Edition
Preface to the First Edition
List of Symbols
Chapter 1: Logic
Chapter 2: Mathematical Proof
Chapter 3: Sets
Chapter 4: Relations
Chapter 5: Functions
Chapter 6: Matrix Algebra
Chapter 7: Systems of Linear Equations
Chapter 8: Algebraic Structures
Chapter 9: Introduction to Number Theory
Chapter 10: Boolean Algebra
Chapter 11: Graph Theory
Chapter 12: Applications of Graph Theory
References and Further Reading
Hints and Solutions to Selected Exercises
Index
β¦ Subjects
ΠΠ°ΡΠ΅ΠΌΠ°ΡΠΈΠΊΠ°;ΠΠΈΡΠΊΡΠ΅ΡΠ½Π°Ρ ΠΌΠ°ΡΠ΅ΠΌΠ°ΡΠΈΠΊΠ°;
π SIMILAR VOLUMES
This third edition offers an introduction to discrete mathematics, covering relations, induction, counting techniques, logic and graphs. More advanced topics of Boolean algebra and permutation groups are included, and there are numerous examples to reinforce the material.
Front Cover; List of Algorithms; Contents; Instructor's Preface; Student's Preface; Chapter Summaries; Pathways Through the Book; Problem Difficulty Rating; Symbols, Notation, Abbreviations and Conventions; Prologue: What is Discrete Algorithmic Mathematics?; CHAPTER 0: Mathematical Preliminaries ;
Thoroughly revised for a one-semester course, this well-known and highly regarded book is an outstanding text for undergraduate discrete mathematics. It has been updated with new or extended discussions of order notation, generating functions, chaos, aspects of statistics, and computational biology.