Well-Formed Formulas in Discrete Mathematics - Rules and Examples
Sundeep Saradhi Kanthety via YouTube
Pass the PMP® Exam on Your First Try — Expert-Led Training
Power BI Fundamentals - Create visualizations and dashboards from scratch
Overview
Google, IBM & Meta Certificates – 40% Off
One plan covers every Professional Certificate on Coursera.
Unlock All Certificates
Learn about Well Formed Formulas (WFF) in discrete mathematics through a 10-minute educational video that covers essential concepts of propositional logic and normal forms. Master the fundamentals of elementary sums and products, understand the differences between Conjunctive Normal Form (CNF) and Disjunctive Normal Form (DNF), and explore atomic and compound propositions. Dive into eight key logical connectives including negation, conjunction, disjunction, conditional, bi-conditional, exclusive disjunction, NAND, and NOR operations used in discrete mathematical structures.
Syllabus
Well Formed Formula (WFF) in Discrete Mathematics || WFF Rules with Examples || DMS || MFCS
Taught by
Sundeep Saradhi Kanthety