Loading…
Luì
How to play
In PROPOSITIONAL LOGIC, the quantifier ∀ does not appear, and the discussion revolves around simple statements with hypotheses and conclusion.
A letter (A, B, C, ...) indicates any statement.

    JEAN-LOUIS KRIVINE

    Jean-Louis Krivine is a French scholar, born in 1939, who has worked in mathematical logic, set theory, and theoretical computer science. He was a student at the École Normale Supérieure in Paris and then taught for many years at the University “Paris Cité” (also known as Paris VII). Among the people who studied under his supervision is Jean-Yves Girard.

    In 1969, he wrote one of the first books on axiomatic set theory, which was widely disseminated. In the field of computing, he devised an abstract computing machine, known as the Krivine machine, which allows for the calculation of particular logical functions.

    In 2007, together with Yves Legrandgérard, he published the article Valid Formulas, Games and Network Protocols, in which the UVA game was introduced, of which Luì (so named in honor of Krivine) is an evolution. The idea of using the UVA game in a educational context is by Emmanuel Beffara, who studied under the supervision of Vincent Danos, who in turn was supervised by Girard.

    Among his students, some phrases he said in class have become popular, such as “Vous pouvez avoir une démonstration triviale qui fait 2 kilomètres de long” (you can have a trivial demonstration that is 2 km long). The meaning is that a long proof is not necessarily difficult to understand and learn, while conversely, a short proof can capture a brilliant and non-spontaneous idea.

    GAME IN ON THE FORMULA

    to play: click on formula you believe is false.

    The set O contains what O affirms to be true.

    U

      The set P contains what P affirms to be true.

      V

        The set T contains what is false for both players.

        A
          Moves

          No moves made yet