Propositional Logic (Solved Problem 2)

Подписаться 2,6 млн

Просмотров 115 тыс.

50% 1

Discrete Mathematics: Propositional Logic (Solved Problem 2)
Topics discussed:
1. Solution of GATE-2008 question based on propositional logic.
Follow Neso Academy on Instagram: @nesoacademy(bit.ly/2XP63OE)
Follow me on Instagram: @jaspreetedu(bit.ly/2YX26E5)
Contribute: www.nesoacademy...
Memberships: bit.ly/2U7YSPI
Books: www.nesoacademy...
Website ► www.nesoacademy...
Forum ► forum.nesoacade...
Facebook ► goo.gl/Nt0PmB
Twitter ► / nesoacademy
Music:
Axol x Alex Skrindo - You [NCS Release]
#DiscreteMathematicsByNeso #DiscreteMaths #PropositionalLogic

Опубликовано:

15 сен 2024

Ссылка:

Скачать:

Готовим ссылку...

Добавить в:

Мой плейлист

Посмотреть позже

Комментарии : 19

@vovanmilos3233 Год назад

Thanks to your previous lessons I already had solved this one by myself, just checked the answer in the end.

@lalitverma5818 6 лет назад

Wow nice question thnx to give solution sir ..Iam prepareing for gate cse

@venkateshmk8824 3 года назад

i am also bro But i am preparing for GATE 2022 please help me something you say bro

@kunalsingh4584 3 года назад

@@venkateshmk8824 me to for 23

@lovishgupta1001 2 года назад

@@detroit0p i m preparing for MCA 1sem at NIT-ALLAHABAD

@khushalkumawat2254 Год назад

@@lovishgupta1001 i m preparing for MCA 1sem at NIT-TRICHY

@ashutoshpatidar3288 9 месяцев назад

so beautifully explained

@amitpal9479 Год назад

if we try to solve it using T and F method, then the answer will be (D)All of these lets assume p and Q both T 1. P or ~Q = T or F = T 2.~(~P^Q) = ~(F^T) = ~F = T 3. (P and Q) or (P and Negation of Q) or (negation of P and negation of Q) = (T and T) or (T and F) or (F and F) = T or F or F= T or F = T 4. (P and Q) or (P and Negation of Q) or (negation of P and Q) = (T and T) or (T and F) or (F and T) = T or F or F= T or F = T

@fighting_125 10 месяцев назад

I love this channel

@priyanshumangal4996 Год назад

By all options 1 and 2 are equal

@OriginalElements5 9 месяцев назад

Thank God for subtitles yo

@advaithkumar5966 Год назад

actually we didn't need to even check 4th since its obvious it cant be equivalent to 1,2,3

@odgarig8601 5 месяцев назад

Why? Can you elaborate?

@odgarig8601 5 месяцев назад

NVM, I took another look at it, and yeah, it was obvious hehe.

@kirekav1199 3 месяца назад

where u have ' in the propositio ?? you make a big trouble you dont need to do that if you know you know, but here is the people who wanna learn. why use simplicity or some s*** in the exam?

@kirekav1199 3 месяца назад

if you write this on exam like here you never pass the exam because its not alowed to make your private math in discrete math .