Modal logic 1.2 - truth trees for system K

แชร์
ฝัง
  • เผยแพร่เมื่อ 23 ก.ค. 2024
  • The rules for truth trees in system K, and some advice about constructing trees in K. I then use trees to prove the validity of two simple arguments.

ความคิดเห็น • 32

  • @hihihihih199
    @hihihihih199 9 ปีที่แล้ว +4

    I just want to say a big big thank you for these videos! I have a pass for progression formal logic university module which I just resat yesterday, I have to say you saved me, I went from not understanding modal logic to being able to do it pretty well!
    Your videos essentially have hopefully saved me from wasting a year as a external student resitting this module.

  • @MaceOjala
    @MaceOjala 7 หลายเดือนก่อน

    I'm reviewing ML basics, and as your long-term follower, it is fun to hear the /young/ Kane B at it :)

  • @EclipsyChannel
    @EclipsyChannel ปีที่แล้ว

    taking a class on Modal logic now and this helped so much (even if in 2022)! thank you!!!!

    • @bobgreenfield9158
      @bobgreenfield9158 ปีที่แล้ว

      The movie The Counselor has dialogue influenced by Modal logic.
      It starred Brad Pitt, Cameron Diaz, Xavier Bordem.

  • @malharjajoo7393
    @malharjajoo7393 7 ปีที่แล้ว

    Thank you so much for sharing these videos.

  • @marialbamata2314
    @marialbamata2314 8 ปีที่แล้ว

    Gracias por estos videos, sirven de mucho para mi parcial de Logica 2. Thanks, you should make more like these.

  • @Dinos4urFour
    @Dinos4urFour 9 ปีที่แล้ว

    Your videos are so helpful, thanks so much!

  • @manavkhatarkar9983
    @manavkhatarkar9983 ปีที่แล้ว

    Thank you Kane B, your videos are really helpful

  • @UnifemDapriest
    @UnifemDapriest 7 ปีที่แล้ว +4

    Thanks for this video. It really helped me. The exercises you added at the end of the video are great but where are the solutions? I will appreciate if you add a document or make a video to that effect. Nice one!

  • @islayozcetin
    @islayozcetin 8 ปีที่แล้ว

    Thank you for your sharing :)

  • @wenaolong
    @wenaolong 7 ปีที่แล้ว +1

    Can it be demonstrated that necessity is NOT distributed over disjunction, just as it is here demonstrated to BE distributed over implication?

  • @frankhubeny958
    @frankhubeny958 5 ปีที่แล้ว +2

    I don't see why we are able to close a whole branch by finding a contradiction in only one opened world. I've asked this question on Philosophy Stack Exchange: philosophy.stackexchange.com/q/57135/29944 Thank you for the video. It has been very helpful.

  • @RomaiVNB
    @RomaiVNB ปีที่แล้ว

    Thank you so much

  • @miguelcoelho2004
    @miguelcoelho2004 9 ปีที่แล้ว

    Dear Kane B, I hope you could help me out here. I'm not getting why you have to stack the worlds if they are derived from the same branch. Or actually why do you evalueate worlds from the same branch together?
    And thanks for the uploads!

    • @lukebradley3193
      @lukebradley3193 5 ปีที่แล้ว

      I had some confusion that, specifically why close the whole branch, read this:
      tinyurl.com/ybkgrz4r
      Basically if a contradiction follows from a claim in any world, it closes all of them. Possibly opens world, if you say possibly x and then it follows that if x is true y and not y is true, the original claim possibly x is not true, x must be false. You don’t have to consider the branch where x is false, you have to get rid of the false claim that x is possibly true.

    • @lukebradley3193
      @lukebradley3193 5 ปีที่แล้ว

      Note that doesn’t mean you have to not consider x being false, just you don’t have to consider it as a consequence of the false claim that x is possibly true. X will either be false or the whole original claim will be a contradiction.

  • @tomcostigan5737
    @tomcostigan5737 7 ปีที่แล้ว +1

    What software do you use to create these truth trees?

    • @KaneB
      @KaneB  7 ปีที่แล้ว +2

      It's just powerpoint.

  • @preducea
    @preducea 9 ปีที่แล้ว +4

    Ok, surely i'm missing something important. Sorry for asking such a dumb question: what does waiting for a new world mean? Can you, please, state the difference between "already having access to a new world from the actual world" and "creating a new world"? in other words, it is unclear to me when i make use of / when it is the case that "i already have an arrow to another world" and "i draw a new arrow and a new world". Thanks!

    • @preducea
      @preducea 9 ปีที่แล้ว

      See from min 3:00

    • @bobgreenfield9158
      @bobgreenfield9158 ปีที่แล้ว

      This also is not clear to me.

    • @gabrieletessore1995
      @gabrieletessore1995 ปีที่แล้ว

      i think it means that, if u know box(A), u can confidently say that in any world w1 accessible from w0, A will hold in w1, but u cant assume that such a world exists: as far as u know, there could be no w1 accessible from w0, so you cant just create one; and this isnt in conflict with knowing box(A): this only says that if a w1 exists, then A will hold, it doesnt say anything about such a world existing.
      its different with diamond, in that if u know diamond(A) in w0, u can confidently say that at least 1 world w1 accessible from w0 exists, and in w1, u can confidently say that A holds.
      thats how i understood it, im not an expert but i think i am right on this

    • @gabrieletessore1995
      @gabrieletessore1995 ปีที่แล้ว

      @@bobgreenfield9158 i wrote an answer, see if its clearer

  • @gabrieletessore1995
    @gabrieletessore1995 ปีที่แล้ว

    i dont understand how the last example works, i did it a bit differently and got a positive result, maybe you could help me understand where i did wrong :)
    after u get the implication not(box(q)) -> not(box(p)), i just rewrote that in the OR version as box(q) OR box(not(p))
    from that, since i have diamond(p), i create a new w1 in which p holds (but where i dont specify that not(q) also holds: my reasoning was that, yes, there must be a world in which p holds and a world in which not(q) holds since we have those formulae in possibility in w0, but these worlds dont have to be the same one; note that i did this just by reasoning, so this might be where i'm wrong).
    going back to w1, i can say that, since i have box(q) OR box(not(p)) in w0, i must have q OR not(p) also in w1, and this doesnt generate a contraddition: i know p holds so not(p) cant also hold, but i assumed i can say that p holds in w1, thus leaving the world open.
    this works the same in a w2 created from the fact that diamond(not(q)) holds in w0, so not(q) holds in w2: in w2 also q OR not(p) holds, and again, p cant hold because i know not(q) holds, but this just leaves a world in which i decided that q holds, and so also w2 is left open.
    if u can help me understanding where is my mistake i'd appreciate it a lot, thanks :)
    also, very good series, i have to write my uni thesis on modal logics and this guide is proving to be very clear and informative

  • @alandavid1634
    @alandavid1634 ปีที่แล้ว

    I still can't get #4 & #8. Anyone care to show me the solutions?

  • @slideysims2196
    @slideysims2196 10 ปีที่แล้ว +1

    @15:29 If I'm not mistaken, you say that the whole tree is closed. w1, however, is still open.

  • @KaneB
    @KaneB  10 ปีที่แล้ว

    No, because w1 and w2 are both on the same branch, which is closed because of the contradiction in w2. The whole tree is closed because all of its branches are closed.

  • @ktube2482
    @ktube2482 7 ปีที่แล้ว

    Why bother writing down w1 if w1 and w2 are analysed together and w2 invalidates w1? Why not just ignore w1 and save on time?

    • @gabrieletessore1995
      @gabrieletessore1995 ปีที่แล้ว

      hes doing this to explain how this works, not prove how fast he can do it

  • @noninvasive_rectal_probe8990
    @noninvasive_rectal_probe8990 3 ปีที่แล้ว

    I'd be damned if this thing is not isomorphic to pure type systems

  • @movax20h
    @movax20h 5 ปีที่แล้ว +2

    Poor and informal introduction. It is supposed to be logic. All I see are adhoc rules and explanations, without prior justifications or even axioms presented.