lectures.alex.balgavy.eu

Lecture notes from university.
git clone git://git.alex.balgavy.eu/lectures.alex.balgavy.eu.git
Log | Files | Refs | Submodules

tree.dot (467B)


      1 digraph gametree {
      2     top [label="[V] ◇ p ∨ □ ◇ p, 2"]
      3     l11 [label="[V] ◇ p, 2"]
      4     l12 [label="[F] □ ◇ p, 2"]
      5     top -> l11
      6     top -> l12
      7     l21 [label="p 3"]
      8     l22 [label="[V] ◇ p, 3"]
      9     l11 -> l21
     10     l12 -> l22
     11     l31 [label="Verifier wins"]
     12     l32 [label="p, 2"]
     13     l33 [label="p, 4"]
     14     l21 -> l31
     15     l22 -> l32
     16     l22 -> l33
     17     l41 [label="Falsifier wins."]
     18     l42 [label="Falsifier wins."]
     19     l32 -> l41
     20     l33 -> l42
     21 }
     22