Discrete Math I (Entire Course) - Discrete Math - 5.3.2 Structural Induction

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

Several proofs using structural induction. These examples revolve around trees. Video Chapters: Introduction 0:00 Mathematical Induction 0:11 Structural Induction 4:23 Full Binary Tree Example 4:58 Structural Induction Proof 7:59 Up Next 11:47 Textbook: Rosen, Discrete Mathematics and Its Applications, 7e Playlist: https://www.youtube.com/playlist?list=PLl-gb0E4MII28GykmtuBXNUNoej-vY5Rz