Jason (jcreed) wrote,

Made some interesting progress thinking about how to decompose weird logical connectives after emailing with chris and ian. I can now say things like "yeah, lightning bolt is just exists x . exists n . !(forall m.a(x, m) -o A * a(x, Sm)) * !(forall m.a(x, m) -o 1) * a(x, n) assuming that a(x * x', n * n') -||- a(x, n) * a(x', n') and S commutes with * and every term can be split like t = π1t * π2t" with a straight face.
Tags: math

  • (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