Udemy

Platform

English

Language

Math

Category

Discrete Math Series : Propositional Logic masterclass

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

4.65 (97 reviews)

Students

3.5 hours

Content

May 2021

Last Update
Regular Price


What you will learn

Master Discrete Mathematics

Master propositional logic

Get ready for advanced topics of computer science

Get ready for research in computer science


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 answersby 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!)


Screenshots

Discrete Math Series : Propositional Logic masterclass
Discrete Math Series : Propositional Logic masterclass
Discrete Math Series : Propositional Logic masterclass
Discrete Math Series : Propositional Logic masterclass

Content

Introduction

How to watch the course

Propositions and basic connectives

Proposition explained with examples

Logical Connectives - AND, OR and NOT

Precedence of Logical Connectives

Demorgan Laws

Proving techniques for logically equivalence of 2 propositional statements

More connectives

Implication explained with example

Double Implication explained with example

Converse, Inverse and Contrapositive of an implication proposition

Converse of implication proposition

Contrapositive of implication proposition

Inverse of implication proposition

Relationship between Converse and Inverse of an implication proposition

Another way of representing implication proposition

Converting English sentences into propositional statements

Precedence of all Logical Connectives

Converting English sentences into propositional statements 1

Various ways of representing implication proposition in english

Problem 1

Problem 2

Problem 3

Propositional functions

What is a propositional function

Examples of propositional functions

Quantifiers

Universal Quantifiers

Examples for universal quantifier

Existential quantifiers

Important point on Universal and Existential quantifier

Summary

Problems

Quantifiers with restricted domain

Restricting the domain using quantifiers

Example for domain restriction using quantifiers

More insights on quantifiers

Precedence of quantifiers

Problems on quantifiers

Problems on quantifiers

Negating Propositions with quantifiers

How to apply negation to a proposition with quantifiers

Play with negation and quantifiers

More problems on negation and quantifiers

More problems on negation and quantifiers

More problems on negation and quantifiers

How propositional statements can change depending on the domain

More problems to show the impact of domains

Problem 1

Problem 2

Problem 3

Problem 4

Problem 5

Nested Quantifiers

Nested Quantifiers explained with example

Important properties of nested quantifiers with example

How to proceed from here

Bonus Section


Reviews

A
Amy30 May 2021

Great course! Very thorough explanations and the instructor conveys both enthusiasm and knowledge of the topics.

N
Netanel30 November 2020

I liked the course it was detailed and concise! Vignesh is a good teacher, because of this I quickly understood the subjects. However, I wish there were more problems to solve, and a few quizzes would have been nice too, if not for that I would have given it five stars.

W
Weronika5 November 2020

Love this course so far. Straight to the point without talking non sense. The instructor explains well and values the time of his students. Great course. I highly recommand it. I'm definietly going to buy other courses from this instructor.

S
SIVA27 August 2020

Nice course. Understanding is more important than knowing to solve problems using some trics. Believe me, it is the best course in Logic.

L
Lionel18 July 2019

A good course that teaches the basic foundations of propositional logic. I really liked the instructor style of delivering the information in a very easy and nice way, however, I think that it would have benefited a lot from including quizzes or assignments to complement the learning process instead of just a series of lectures. The lectures themselves were fine, and at an appropriate length, but fell short when it came to quizzing. Overall, it is a worthwhile course for understanding the basics of propositional logic!

J
Jack14 May 2019

As someone new to discrete math this course has been great. The concepts are explained simply and effectively and I never felt overwhelmed by the content.

K
Keith3 May 2019

A great introduction to discrete mathematics. I'm especially interested in propositional logic and learned a lot about quantifiers. Also, instructor worked through many examples.

S
Shaveen19 April 2019

This course doesn't have the part where we learn how to check whether a given argument is valid or not according to a give set of prepositions, I gave 4.5 because of that, otherwise a great course.

H
Harikrishnan27 November 2018

Easily understandable chunks. Author should also do other areas of discrete mathematics like graph theory , combinatorics etc.,


1619932

Udemy ID

3/28/2018

Course created date

11/21/2019

Course Indexed date
Bot
Course Submitted by