chapter 1 the foundations logic and proofs
Download
Skip this Video
Download Presentation
Chapter 1: The Foundations: Logic and Proofs

Loading in 2 Seconds...

play fullscreen
1 / 14

Chapter 1: The Foundations: Logic and Proofs - PowerPoint PPT Presentation


  • 144 Views
  • Uploaded on

Chapter 1: The Foundations: Logic and Proofs. 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. 1.2: Propositional Equivalences. Definition:

loader
I am the owner, or an agent authorized to act on behalf of the owner, of the copyrighted work described.
capcha
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

Chapter 1: The Foundations: Logic and Proofs

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

1 2 propositional equivalences

1.2: Propositional Equivalences

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.

logical equivalences

Logical Equivalences

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 pq is a tautology. Denote pq.

logical equivalences1

Logical Equivalences

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

Symbol: PQ

slide6

Logical Equivalences

  • Prove the De Morgan’s Laws.
slide7

Logical Equivalences

  • HW: Prove the other one (De Morgan’s Laws).
example show that p q and p q are logically equivalent hw example 4 of page 23

Logical Equivalences

Example:

Show that pq and ¬pqare logically equivalent.

HW: example 4 of page 23

slide12

Logical Equivalences

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”.

slide13

Logical Equivalences

  • Example 6: Show that ¬(pq) 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) (pq) is a tautology.
slide14

Terms

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