Introduction to discrete mathematics
By: R. Hirschfelder, J. Hirschfelder.
Contributors: Hirschfelder, J. 1943-
Publisher: Brooks/Cole
Published: 1991
Place of publication: Pacific Grove, Calif
Language: eng
Number of pages: 535
Subjects: Computer science -- Mathematics.
Other titles: Discreet mathematics.
Notes: Includes bibliographical references (p. 472-474) and index.
Table of contents: label: Part I
title: Fundamentals; label: 1
title: Number Systems and Representations
pagenum: 3; label: 1.1
title: Natural Numbers
pagenum: 3; label: 1.2
title: Arithmetic with Natural Numbers
pagenum: 7; label: 1.3
title: Summation and Product Notation
pagenum: 9; label: 1.4
title: Integers and Rational Numbers
pagenum: 12; label: 1.5
title: The Real and Complex Numbers
pagenum: 16; label: 1.6
title: Arithmetic in the Integers Modulo n
pagenum: 22; title: Chapter Review Exercises
pagenum: 29; label: 2
title: Sets
pagenum: 32; label: 2.1
title: Sets and Subsets
pagenum: 32; label: 2.2
title: Operations on Sets and Set Algebra
pagenum: 35; label: 2.3
title: Sets of Real Numbers
pagenum: 40; label: 2.4
title: Cartesian Products of Sets
pagenum: 42; label: 2.5
title: Finite and Infinite Sets
pagenum: 44; label: 2.6
title: Mathematical Induction
pagenum: 48; label: 2.7
title: Representation of Sets in Computers
pagenum: 54; title: Chapter Review Exercises
pagenum: 57; label: 3
title: Functions and Relations
pagenum: 59; label: 3.1
title: Functions
pagenum: 59; label: 3.2
title: Operations with Functions
pagenum: 67; label: 3.3
title: Relations
pagenum: 75; label: 3.4
title: Equivalence Relations
pagenum: 82; label: 3.5
title: Order Relations
pagenum: 89; label: 3.6
title: Relational Data Bases
pagenum: 93; title: Chapter Review Exercises
pagenum: 97; label: Part II
title: Basic Discrete Mathematics
pagenum: 99; label: 4
title: Logic and Proof
pagenum: 101; label: 4.1
title: Propositions and Connectives
pagenum: 101; label: 4.2
title: Tautologies and the Algebra of Propositions
pagenum: 108; label: 4.3
title: Methods of Mathematical Proof
pagenum: 112; label: 4.4
title: Propositional Functions
pagenum: 117; label: 4.5
title: Quantifiers
pagenum: 121; label: 4.6
title: Working with Formulas Containing Quantifiers
pagenum: 124; label: 4.7
title: Valid Arguments of Predicate Logic
pagenum: 130; title: Chapter Review Exercises
pagenum: 134; label: 5
title: Boolean Algebra and Logic Circuits
pagenum: 138; label: 5.1
title: Boolean Algebras
pagenum: 138; label: 5.2
title: Representing Boolean Functions by Expressions
pagenum: 147; label: 5.3
title: Logic Circuits
pagenum: 157; label: 5.4
title: Feedback and Memory Circuits
pagenum: 166; title: Chapter Review Exercises
pagenum: 169; label: 6
title: Combinatorics and Discrete Probability
pagenum: 172; label: 6.1
title: Counting Techniques
pagenum: 172; label: 6.2
title: Permutations
pagenum: 180; label: 6.3
title: Combinations
pagenum: 183; label: 6.4
title: Binomial Coefficients
pagenum: 187; label: 6.5
title: Discrete Probability
pagenum: 191; label: 6.6
title: Additional Topics in Probability
pagenum: 200; title: Chapter Review Exercises
pagenum: 213; label: 7
title: Graphs
pagenum: 215; label: 7.1
title: Concepts and Terminology
pagenum: 218; label: 7.2
title: Connectivity
pagenum: 230; label: 7.3
title: Some Classical Problems
pagenum: 238; label: 7.4
title: Directed Graphs
pagenum: 247; label: 7.5
title: The Shortest-Path Algorithm
pagenum: 257; title: Chapter Review Exercises
pagenum: 262; label: 8
title: Trees
pagenum: 268; label: 8.1
title: Characterizations of Trees
pagenum: 268; label: 8.2
title: Spanning Trees
pagenum: 278; label: 8.3
title: Binary Trees
pagenum: 284; label: 8.4
title: Traversing Rooted Trees
pagenum: 292; title: Chapter Review Exercises
pagenum: 300; label: 9
title: Recurrence Relations and Dynamical Systems
pagenum: 303; label: 9.1
title: Recurrence Relations
pagenum: 303; label: 9.2
title: First-Order Linear Relations
pagenum: 312; label: 9.3
title: Linear Homogeneous Relations
pagenum: 317; label: 9.4
title: Nonhomogeneous Systems
pagenum: 325; label: 9.5
title: Numerical Experimentation
pagenum: 328; label: 9.6
title: Additional Topics
pagenum: 336; title: Chapter Review Exercises
pagenum: 346; label: Part III
title: Advanced Topics
pagenum: 349; label: 10
title: Topics from Number Theory
pagenum: 351; label: 10.1
title: Divisibility
pagenum: 351; label: 10.2
title: Primes and Factorization
pagenum: 357; label: 10.3
title: Linear Diophantine Equations
pagenum: 362; label: 10.4
title: More about Linear Diophantine Equations
pagenum: 368; label: 10.5
title: Another Method for Diophantine Equations
pagenum: 373; label: 10.6
title: Continued Fractions
pagenum: 377; title: Chapter Review Exercises
pagenum: 386; label: 11
title: Languages and Grammars
pagenum: 388; label: 11.1
title: Vocabularies, Sentences, and Languages
pagenum: 388; label: 11.2
title: Specifying Languages: Productions
pagenum: 393; label: 11.3
title: Other Ways of Specifying Languages
pagenum: 401; label: 11.4
title: The Languages of Logic and Mathematics
pagenum: 407; title: Chapter Review Exercises
pagenum: 411; label: 12
title: Machines and Computation
pagenum: 413; label: 12.1
title: Models of Computation
pagenum: 413; label: 12.2
title: Finite State Machines
pagenum: 416; label: 12.3
title: Language Recognition
pagenum: 423; label: 12.4
title: Finite State Machines and Regular Grammars
pagenum: 430; label: 12.5
title: Designing a Machine to Recognize a Regular Language
pagenum: 435; label: 12.6
title: Turing Machines
pagenum: 442; label: 12.7
title: The Halting Problem
pagenum: 449; title: Chapter Review Exercises
pagenum: 452; title: Appendixes; label: A
title: Glossary
pagenum: 455; label: B
title: Suggested Readings
pagenum: 472; label: C
title: Answers to Odd-Numbered Exercises
pagenum: 475; title: Index
pagenum: 529