Jason (jcreed) wrote,

Talked some more with Rowan today in which I discovered the fascinating fact that the modal Diamond in "Pfenning-Davies K" according to the recent "Weather Report" draft is not quite what I would have predicted from the modal encoding I worked out with Sean last summer. A shibboleth proposition is:

<><>0 |- <>0

which my system (given a krikpe relation with no particular properties) will nonetheless prove, and which Pfenning-Davies K does not.

This is because their <>L rule is like

A |- C
G, <>A |- C poss

and mine turns out to be something way weirder, which is close to being like

A |- poss
G, <>A |- C poss

with some sort of abomination where the conclusion is poss (thus permitting further <>L decompositions) but there's nothing there, so my system still does refuse to prove

<><>A |- <>A

in general, just like you'd expect from K.
Tags: logic, math, modal

  • (no subject)

    Something that's bugged me for a long time is this: How many paths, starting at the origin, taking N steps either up, down, left or right, end up at…

  • (no subject)

    Still sad that SAC seems to end up being as complicated as it is. Surely there's some deeper duality between…

  • (no subject)

    I had already been meaning to dig into JaneSt's "Incremental" library, which bills itself as a practical implementation (in ocaml) of the ideas in…

  • Post a new comment


    Anonymous comments are disabled in this journal

    default userpic

    Your reply will be screened

    Your IP address will be recorded