Discrete Math I (Entire Course) - Discrete Math - 1.3.2 Key Logical Equivalences Including De Morgan’s Laws

Unlock the Logic: Master Discrete Math with Kimberly Brehm – From Propositions to Graphs, Equip Yourself with Essential Problem-Solving Skills!

5.0 (2)

18 learners

What you'll learn

Understand and apply logical operations and connectives in propositions.
Construct truth tables to evaluate compound statements and logical equivalences.
Translate complex logic statements into predicate logic with quantifiers.
Utilize set theory and functions in solving mathematical and real-world problems.

This course includes

18.5 hours of video
Certificate of completion
Access on mobile and TV

Summary

Full Transcript

A listing of many of the key logical equivalences we will need in proving or constructing new logical equivalences. Video Chapters: Introduction 0:00 Identity, Domination, Idempotent, Double Negation, Absorption, Negation 0:30 Commutative, Distributive, Associative, De Morgan's 2:18 Showing De Morgan's First Law is Logically Equivalent 4:22 A Few More Equivalences (You MAY have to prove these) 5:17 Up Next 6:02 Textbook: Rosen, Discrete Mathematics and Its Applications, 7e Playlist: https://www.youtube.com/playlist?list=PLl-gb0E4MII28GykmtuBXNUNoej-vY5Rz