Logical equivalence without truth tables (Screencast 2.2.4)

Поделиться
HTML-код
  • Опубликовано: 19 окт 2024

Комментарии • 33

  • @evelynwallace25
    @evelynwallace25 8 лет назад +15

    Thank you! I missed the class that covered this material. Thank god for the internet and kind strangers.

  • @astyanax905
    @astyanax905 9 лет назад +5

    Clear, concise, accurate.
    Good stuff. Appreciate it.

  • @VALR1able
    @VALR1able 2 года назад +2

    Thank you very much for this video. It certainly helps to make this topic clearer.

  • @joshuanicholls2692
    @joshuanicholls2692 9 лет назад +3

    Thank you so much for this :)
    Now comes the challenge of memorising tautologies and using them for my proofs.

  • @therealmaveric
    @therealmaveric 12 лет назад +2

    Excellent video this really helped me understand what really is a simple concept.

  • @Vativ
    @Vativ 3 года назад +2

    This video is poggers!

  • @user-ww3rm3mz3i
    @user-ww3rm3mz3i 5 лет назад +1

    Thanks this so well done and explained, wish you also did Modal Logic and PA

  • @SangaJanga
    @SangaJanga 12 лет назад +1

    thanks this helped so much! please continue doing discrete math videos!

  • @silastops6253
    @silastops6253 7 лет назад

    Thanks, its clear and precise. I managed to gain an insight.

  • @ZuhaaFatima-gw7mj
    @ZuhaaFatima-gw7mj 11 месяцев назад

    thank you so much 😊

  • @nayabtahir8454
    @nayabtahir8454 4 года назад +1

    Thankyou so much its very helpful

  • @hufflepuffsunited7827
    @hufflepuffsunited7827 11 лет назад

    This was very helpful. Thanks a lot!

  • @ilhampamungkas2865
    @ilhampamungkas2865 8 лет назад +1

    well this is really helpfull, but what if i have, lets say 4/5 proposition. can i still practice this method or what

  • @fastsolution
    @fastsolution 11 лет назад

    one thing i dont understand in this video that in the conditional statement negation in only on p why you put negation on whole statement plzzz i am confused clear me thanks!

  • @rashmikadeshan2710
    @rashmikadeshan2710 3 года назад

    thank you

  • @Tube-uv9fp
    @Tube-uv9fp 3 года назад

    Thanks alot

  • @marrjoja
    @marrjoja 10 лет назад +2

    Thank you Thank you very much for your explanation! ! You really helped me T_T

  • @mohammedashiq2457
    @mohammedashiq2457 7 лет назад

    P->q(~pVq)Can u prove this without using truthtable?

  • @ankitgupta8797
    @ankitgupta8797 3 года назад

    How to prove two given statements not to be logically equivalent ?

  • @ariap9697
    @ariap9697 7 лет назад

    thanks, it was great.

  • @serenataoglucolonnello5771
    @serenataoglucolonnello5771 3 года назад

    Hi, Is there a way to contact you?

  • @kevinwei667
    @kevinwei667 6 лет назад

    thank you so much

  • @sajiiidali
    @sajiiidali 8 лет назад +1

    (~p(~q ᴧ r )) v ( q ᴧ r ) v ( p ᴧ r ) ↔ r plz solve this equation by laws of logic..... i m waiting ur answer

  • @roohishakir183
    @roohishakir183 6 лет назад

    thanks sir g

  • @CubanSauce
    @CubanSauce 10 лет назад

    Interesting. It confuses me that you can do something to one side and not to the other. Math, i tell you.

    • @MrDiscussion
      @MrDiscussion 10 лет назад +2

      actually u are not changing either of the sides, just rewrite it in a different form. It stil means the exact same thing.

    • @LoLei3239
      @LoLei3239 9 лет назад +1

      IssaUzumakii And since the condition is that both sides are equivalent, changing one side to something else which is equivalent to itself, makes it automatically equivalent to the other side again too.

  • @particlestudies2823
    @particlestudies2823 4 года назад

    thanks for nothing