Discrete Mathematics Review 1

I.

Logic
A.

Proposition

B.

Logical Operators
1.

And

2.

Or

3.

Xor

4.

Not

5.

Implies

6.

C.

D.

a.

In terms of Or and Not

b.

Hypothesis and Conclusion

c.

Truth Table

d.

Converse, Inverse, Contrapositive

Biconditional
a.

If and only if !

b.

Necessary and Sufficient

English Statements
1.

From English to Symbols

2.

From Symbols to English

Truth Tables
1.

Finding Truth Tables

2.

Tautology
a.

3.

Contradiction
a.

4.

F.

False for all values of the variables

p and q logically equivalent

a.

E.

True for all values of the variables

Truth table for p ! q is a tautology

Logical Equivalences
1.

Associative and Distributive Laws

2.

Negation Laws

3.

Logical equivalences for implies (will be supplied if needed for test)

4.

Logical equivalences for biconditional (will be supplied if needed for test)

Predicates
1.

2.

3.

Universal quantifier
a.

For every, for all x P(x)

b.

Negation: there is an x such that Not P(x)

Existential quantifier
a.

There exists, there is

b.

Negation

Negating nested quantifiers

Discrete Mathematics Review 1 page 1

4.
G.

Rules of Inference
1.

H.

Table supplied on exam

Methods of Proof
1.

2.

I.I

Order of quantifiers

Direct Proofs
a.

Write down steps

b.

Do special cases

c.

See if can start in the middle and work toward both ends

d.

Exhaust cases

Indirect proofs
a.

By contradiction

b.

Contrapositive

Set Theory
A.

Descriptions of Sets
1.

Braces
a. Enumeration
b.

2.
B.

With predicate

Venn Diagrams

Operations on Sets
1.

Union, intersections, complements

a.

De Morgans Laws

2.

Power set

3.

Partitions

4.

Subsets
a.

5.

Power Set

Equality of sets
a.

A " B and B " A implies A = B

b.

Truth tables

6.

Use of induction

7.

Counting Elements in sets

Discrete Mathematics Review 1 page 2