Propositional Logic: Equivalences, Tautologies, and Contradictions, Lecture notes of Discrete Mathematics

A comprehensive introduction to propositional logic, focusing on logical equivalences, tautologies, contradictions, and contingencies. It explores key concepts like the definition of conditional statements, converse, inverse, and contrapositive, and delves into de morgan's laws. Examples and exercises to solidify understanding and encourages students to apply these concepts in problem-solving.

Typology: Lecture notes

2023/2024

Uploaded on 10/27/2024

maverick-madison
maverick-madison ๐Ÿ‡บ๐Ÿ‡ธ

1 document

1 / 7

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
Module 1 Logical equivalences.
Section 1.3 in the book.
Propositional Equivalences
Learning Goals
โ€ขKnow the definition of tautology, contradiction, contingency, and logical
equivalence.
โ€ข Be familiar with the basic laws of logical equivalence.
โ€ข Use laws of logical equivalence (also known as algebraic laws of logic) to simplify
compound propositions and identify them as tautologies, contradictions or
contingencies or to prove logical equivalences.
Homework
Read Module 1: Slides and Examples.
Complete: Edfinity Propositional Equivalences
Written Homework Propositional Logic
WebWork: work on assignment 10.1
pf3
pf4
pf5

Partial preview of the text

Download Propositional Logic: Equivalences, Tautologies, and Contradictions and more Lecture notes Discrete Mathematics in PDF only on Docsity!

Section 1.3 in the book.

Propositional Equivalences

Learning Goals

  • Know the definition of tautology, contradiction, contingency, and logical

equivalence.

  • Be familiar with the basic laws of logical equivalence.
  • Use laws of logical equivalence (also known as algebraic laws of logic) to simplify

compound propositions and identify them as tautologies, contradictions or

contingencies or to prove logical equivalences.

Homework

Read Module 1: Slides and Examples.

Complete: Edfinity Propositional Equivalences

Written Homework Propositional Logic

WebWork: work on assignment 10.

Section 1.3 in the book.

Converse, inverse, contrapositive of a conditional statement ๐’‘ โ†’ ๐’’.

Conditional: ๐‘ โ†’ ๐‘ž ; Converse: ๐‘ž โ†’ ๐‘;

Inverse: ยฌ๐‘ โ†’ ยฌ๐‘ž ; Contrapositive : ยฌ๐‘ž โ†’ ยฌ๐‘;

If I study, then I get an A on my exam.

Converse:

Inverse:

Contrapositive:

Tautology : A logical expression which is always true regardless of the truth values

of the variables.

Contradiction : A logical expression which is always false regardless of the truth

values of the variables.

Neither tautology nor contradiction is called a contingency.

Section 1.3 in the book.

3. Laws of D Morgan, the negation of disjunction and conjunction

๐‘: Joe is famous ๐‘ž: Joe is rich

4. Negation of conditional: ยฌ

Section 1.3 in the book.

Statement

If x is a rational number and y is a rational number, then x+y is a rational number.

Find the negation of the statement:

Find the contrapositive of the statement:

Section 1.3 in the book.

Example : Select the statement that is logically equivalent to

โ€œIf you can dream it, then you can achieve itโ€.

๐‘  โ‰” โ€œyou can dream itโ€ and ๐‘Ÿ โ‰” โ€œyou can achieve itโ€

Express each of the following conditional, in โ€œIf โ€ฆthenโ€ and then use the variable ๐‘ 

and ๐‘Ÿ express the implication.

a. You canโ€™t achieve it unless you dream it.

b. You can achieve it only if you dream it.

c. Achieving it is a sufficient condition for dreaming it.

d. Dreaming it is a necessary condition for achieving it.

e. Achieving it is a necessary condition for dreaming it.