Discrete Math Series : Propositional Logic Masterclass

Learn Discrete Mathematics from scratch as Discrete Mathematics form the core of Computer Science

What you’ll learn
Master Discrete Mathematics
Master propositional logic
Get ready for advanced topics of computer science
Get ready for research in computer science

Requirements
Have a PC with internet connection
Even zero knowledge in discrete mathematics is fine – I will teach you everything

Description
You’ve just stumbled upon the most in-depth Discrete Math course series online. With over 15,000 students enrolled and thousands of 5 star reviews to date in the area of computer science, my computer science courses are enjoyed by students from 130 countries. Whether you want to:- build the skills in propositional logic topic of discrete math- crack interview or competitive exam questions on propositional logic topic of discrete math…this complete Masterclass on propositional logic is the course you need to do.Why would you choose to learn this course ?The reality is that there is a lot of computer science courses out there. It’s in the hundreds. Why would you choose my courses ?The number one reason is its simplicity. According to many students in udemy, my courses are simple to understand as I always teach concepts from scratch in a simple language.The second reason is you get a mentor for computer science through this course. I get lot of doubts from students regarding their career in computer science like which elective subject to choose, which book to refer, etc. The third reason is, you are not just watching my videos, you can also ask doubts if you get one while watching the lectures. Which text book should you refer ?I have used Henneth H Rosen textbook. Its a great textbook. You can follow it. But I have referred lot of other textbooks as well. So its upto you on which textbook you are comfortable with but follow a standard author book. If you complete this course, you will find it much easier to understand these textbooks. But anyway if you complete this course with good detailed notes, you don’t need to read any textbook as I am reading them for you and giving the contents in an easy to understand manner.Why should you take this course?You will be joining over 15000 students who are already enrolled in one of my courses.There are 4000+ reviews left by students. My Courses are rated as the best course to learn computer science for beginners.What makes this course a standout?Like you, thousands of others were frustrated and fed up with incomplete Youtube tutorials which assume you already know a bunch of stuff and also bulk textbooks able to send even the most intuitive person to sleep.Like you, they were tired of low-quality lessons, poorly explained topics and all-round confusing info presented in the wrong way. That’s why so many find success in my courses. It’s designed in a simple manner so that anybody will be able to understand. What if I have questions?You can ask questions anytime using the Q/A section or through personal messages. I take it very seriously and answer these questions in a detailed manner with simple english words so that anybody can understand it. Student Quote: “Everything you always wanted to know about OS but were afraid to ask”…And Vignesh Sekar gives the right answers” by Claus Kaliba.There’s no risk either!This course comes with a full 30 day money-back guarantee. Meaning if you are not completely satisfied with the course, you can request udemy for a refund within the first 30 days of purchase.You either end up with Computer Organization skills, learn other core computer subjects, get placed in top notch companies or research areas or you try the course and simply get all your money back if you don’t like it…You literally can’t lose.Ready to get started ?Enrol now using the “Add to Cart” button on the right, and get started on your way to computer science. See you on the inside (hurry, Discrete Math Series is waiting!)

Overview
Section 1: Propositions and basic connectives

Lecture 1 Important : Proposition explained with examples

Lecture 2 Logical Connectives – AND, OR and NOT

Lecture 3 Precedence of Logical Connectives

Lecture 4 Demorgan Laws

Lecture 5 Proving techniques for logically equivalence of 2 propositional statements

Section 2: More connectives

Lecture 6 Implication explained with example

Lecture 7 Double Implication explained with example

Section 3: Converse, Inverse and Contrapositive of an implication proposition

Lecture 8 Converse of implication proposition

Lecture 9 Contrapositive of implication proposition

Lecture 10 Inverse of implication proposition

Lecture 11 Relationship between Converse and Inverse of an implication proposition

Lecture 12 Another way of representing implication proposition

Section 4: Converting English sentences into propositional statements

Lecture 13 Precedence of all Logical Connectives

Lecture 14 Converting English sentences into propositional statements 1

Lecture 15 Various ways of representing implication proposition in english

Lecture 16 Problem 1

Lecture 17 Problem 2

Lecture 18 Problem 3

Section 5: Propositional functions

Lecture 19 What is a propositional function

Lecture 20 Examples of propositional functions

Section 6: Quantifiers

Lecture 21 Universal Quantifiers

Lecture 22 Examples for universal quantifier

Lecture 23 Existential quantifiers

Lecture 24 Important point on Universal and Existential quantifier

Lecture 25 Summary

Lecture 26 Problems

Section 7: Quantifiers with restricted domain

Lecture 27 Restricting the domain using quantifiers

Lecture 28 Example for domain restriction using quantifiers

Section 8: More insights on quantifiers

Lecture 29 Precedence of quantifiers

Lecture 30 Problems on quantifiers

Lecture 31 Problems on quantifiers

Section 9: Negating Propositions with quantifiers

Lecture 32 How to apply negation to a proposition with quantifiers

Lecture 33 Play with negation and quantifiers

Lecture 34 More problems on negation and quantifiers

Lecture 35 More problems on negation and quantifiers

Lecture 36 More problems on negation and quantifiers

Lecture 37 How propositional statements can change depending on the domain

Lecture 38 More problems to show the impact of domains

Lecture 39 Problem 1

Lecture 40 Problem 2

Lecture 41 Problem 3

Lecture 42 Problem 4

Lecture 43 Problem 5

Section 10: Nested Quantifiers

Lecture 44 Nested Quantifiers explained with example

Lecture 45 Important properties of nested quantifiers with example

Section 11: Bonus section : How to proceed from here

Lecture 46 Bonus Section

Any computer science student,Anybody who is interested to do a research in computer science,Any Engineer who wants to build logical thinking,Anybody who likes to analyse mathematics,Any body who is preparing for exams like GATE , PGEE , ISRO etc.,Anybody who wants to master propositional logic,Anybody who wants to understand advanced concepts of Discrete Mathematics,Anybody who wants to learn Discrete Mathematics from scratch,Anyone who wants to learn set theory from scratch