Loading in 5 sec....

Chapter 1: The Foundations: Logic and ProofsPowerPoint Presentation

Chapter 1: The Foundations: Logic and Proofs

- By
**zoe** - Follow User

- 144 Views
- Uploaded on

Download Presentation
## PowerPoint Slideshow about ' Chapter 1: The Foundations: Logic and Proofs' - zoe

**An Image/Link below is provided (as is) to download presentation**

Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.

- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -

Presentation Transcript

### Chapter 1: The Foundations: Logic and Proofs

### 1.2: Propositional Equivalences

### Logical Equivalences

### Logical Equivalences

1.1 Propositional Logic

1.2 Propositional Equivalences

1.3 Predicates and Quantifiers

1.4 Nested Quantifiers

1.5 Rules of Inference

1.6 Introduction to Proofs

1.7 Proof Methods and Strategy

Definition:

Tautology: A compound proposition that is always true.

Contradiction: A compound proposition that is always false.

Contingency: A compound proposition that is neither a tautology nor a contradiction.

Compound propositions that have the same truth values in all possible cases are called logically equivalent.

Definition:

The compound propositions p and q are called logically equivalent if pq is a tautology. Denote pq.

One way to determine whether two compound propositions are equivalent is to use a truth table.

Symbol: PQ

- Prove the De Morgan’s Laws.

- HW: Prove the other one (De Morgan’s Laws).

Example:

Show that pq and ¬pqare logically equivalent.

HW: example 4 of page 23

t01_2_006.jpg

Example 5: Use De Morgan’s laws to express the negations of “Miguel has a cellphone and he has a laptop computer”.

Example 5: Use De Morgan’s laws to express the negations of “Heather will go to the concert or Steve will go to the concert”.

- Example 6: Show that ¬(pq) and p ¬q are logically equivalent.
- Example 7: Show that ¬(p(¬p q)) and ¬p ¬q are logically equivalent by developing a serious of logical equivalences.
- Example 8: Show that (p q) (pq) is a tautology.

- Tautology
- Contradiction
- Contingency
- Logical Equivalence
- De Morgan’s Laws
- Commutative Law
- Associative Law
- Distributive Law

Download Presentation

Connecting to Server..