Please Login To Continue

Overview of Course (in Hindi)

Lesson 1 of 25 • 200 upvotes • 4:28mins

Avatar

Nisha Mittal

In this lesson Nisha Mittal will provide detail of the Course related to propositional logic of discrete structure .

Continue on app
1

Overview of Course (in Hindi)

4:28mins

2

Which of the Following Propositions is a Tautology (in Hindi)

8:53mins

3

Propositional Logic About Implication (in Hindi)

8:10mins

4

Propositional Logic about Biconditional (in Hindi)

8:06mins

5

The Proposition p ∧ (∼ p ∨ q) is Equivalent to (in Hindi)

8:11mins

6

Integer value that satisfies ¬((p → q) ∧ (¬r ∨ ¬s)) (in Hindi)

8:14mins

7

Consider the statement “Not all that glitters is gold” (in Hindi )

8:02mins

8

X denote (P v Q) → R and Y denote (P → R) v (Q → R) (in Hindi)

8:13mins

9

Every teacher is liked by some student propositional logic (in Hindi)

8:11mins

10

Which statement is correct (in Hindi)

8:15mins

11

Find the tautology (in Hindi)

8:07mins

12

P and Q are two propositions.Which of the logical expressions are equivalent? (In Hindi)

8:02mins

13

Which of the following is TRUE?satisfiable and not satisfiable(in Hindi )

8:07mins

14

Show that (p → q) ∧ (q → r) → (p → r) is a tautology(in Hindi)

8:14mins

15

Show that (p → q) ∨ (p → r) and (p → (q ∨ r)) are logically equivalent(in Hindi)

8:01mins

16

Which of the following is the negation of [∀x, α →(∃y, β →(∀u, ∃v, y))]( in Hindi)

6:21mins

17

The CORRECT formula for the sentence, “not all rainy days are cold” (in Hindi )

4:36mins

18

Integer number divisonal by a number (in Hindi )

5:37mins

19

How many multiples of 6 are there between the following pairs of numbers?( In Hindi )

3:40mins

20

Convert this argument into logical notations( in Hindi )

5:01mins

21

Find the solution of the expression (in Hindi )

5:10mins

22

Correct inference of the expression( in Hindi )

5:04mins

23

Well formed formula related to quantifier (in Hindi )

5:22mins

24

Show this is tautology( in Hindi )

6:04mins

25

Solve for tautology with Boolean laws( in Hindi )

6:10mins

Crack NTA-UGC-NET & SET Exams with Unacademy

Get subscription and access unlimited live and recorded courses from India's best educators
Structured syllabus
Structured syllabus
Daily live classes
Daily live classes
Ask doubts
Ask doubts
Tests & practice
Tests & practice

More from Nisha Mittal

thumbnail
HindiComputer Science & Application

Understanding DBMS Normal Form Concept

Nisha Mittal

Similar Plus Courses

Unacademy is India’s largest online learning platform. Download our apps to start learning


Starting your preparation?

Call us and we will answer all your questions about learning on Unacademy

Call +91 8585858585
Company
About usShikshodayaCareersBlogsPrivacy PolicyTerms and Conditions
Products
Learner appLearner appEducator appEducator appParent appParent app