3.2.1 Natural Deduction - Basic Proofs

Поділитися
Вставка
  • Опубліковано 6 лис 2024

КОМЕНТАРІ • 22

  • @NyaLexar
    @NyaLexar 4 роки тому +8

    im crying i have a midterm on this and my teacher explains the subject with complicated words and this made it so much easier to understand tysm

  • @morgard211
    @morgard211 4 роки тому +4

    This is extremely useful. Thank you!

  • @chocolatechip4777
    @chocolatechip4777 4 роки тому

    Thanks for the video, my study material was very unclear to me, but now I completely get it.

  • @elijahsawyer513
    @elijahsawyer513 5 років тому +4

    thank you for the help. great video

  • @chippynotty2984
    @chippynotty2984 5 років тому +6

    Great video cheers

  • @noaag
    @noaag 4 роки тому +3

    Thank you!!! I am gonna do so well on this test.
    Note: I like how you refer to logical proofs as "The Game". Like it's the rap game. Haha.

  • @dostonbekmatyakubov1898
    @dostonbekmatyakubov1898 4 роки тому +1

    Many thanks, nice explanation

  • @DigitalGnosis
    @DigitalGnosis 4 роки тому +2

    Thanks for the video - out of interest why does anyone use natural deduction over the tableax method?

  • @willemesterhuyse2547
    @willemesterhuyse2547 2 місяці тому

    At timestep 38:09 in line 6 you haven't got ~(q OR r) you have q OR r so you can't use Modus Tollens to conclude ~s in line 7.

    • @willemesterhuyse2547
      @willemesterhuyse2547 2 місяці тому

      No, I see now there is a negation in the consequent of the conditional statement.

  • @KianBrose
    @KianBrose 3 роки тому

    Still fail to see how natural deduction or discrete math is useful in any aspect of programming or why it's required in programming courses, asked a couple dozen programmers if they have ever used it they all said no

    • @Karlthegreat100
      @Karlthegreat100 3 роки тому +1

      Proofs are not that important in programming. But like Dijkstra said, "CS is to computers like Astronomy is to telescopes". Programming is a by-product of CS. CS and math are where proofs are important. Such as proving whether your program terminates, whether your program gives the correct output, what's the time complexity of your program, or even something in Theoretical CS like whether some algorithm is in P or in NP.

  • @mitsakosclasher739
    @mitsakosclasher739 5 років тому +5

    Τhank you!!

  • @csperi-peri2447
    @csperi-peri2447 3 роки тому

    Great video!

  • @mert_kaan_yilmaz
    @mert_kaan_yilmaz 4 роки тому +1

    Thank you soo much

  • @mrkurdo5421
    @mrkurdo5421 4 роки тому

    Thank you!

  • @hanaibrahim1563
    @hanaibrahim1563 2 роки тому

    Thank you :) very easy to follow!

  • @marijanamijic5007
    @marijanamijic5007 5 років тому

    I don't understan how you used (qVr) to get ~s didn't you suposed to use ~(qVr) so you can apply Modus tollens and get ~s

  • @Addiwasabi
    @Addiwasabi 4 роки тому +2

    shouts out steers-mccrum

  • @ramidhouib1422
    @ramidhouib1422 4 роки тому +3

    excellent ! i mean why useless youtubers are famous and something as clear asthis is buried :/

  • @renzbandoquillo8313
    @renzbandoquillo8313 4 роки тому

    How to prove this
    Prove: (M/W
    1.(A->~A)
    2.(A->W)
    3.(~A->M)
    And
    Prove: (X/Z)
    1. [(X/Z) → ~K]
    2. [W → (C/~P)]
    3. [(C/~P) → (X&W)]
    4. { ~[~W / ~(X/Z)] / (X&~Z)}
    5. {~ (X&W) / ~[(X/Z) & ~K]}

  • @aryan_kode
    @aryan_kode 4 роки тому

    bhaskar ne bola ye padh lo