lectures.alex.balgavy.eu

commit b4ca636c616458caa4b9bf49650bee9709de15e0
parent f5ca5df8b25870b6768905a5f77c4c1a8c598012
Author: Alex Balgavy <alex@balgavy.eu>
Date:   Sat, 26 Feb 2022 19:49:37 +0100

Small change to exercise 3

Diffstat:
M
content/advanced-logic-notes/exercise-3/index.md
 | 
3
++-

1 file changed, 2 insertions(+), 1 deletion(-)
diff --git a/content/advanced-logic-notes/exercise-3/index.md b/content/advanced-logic-notes/exercise-3/index.md
@@ -64,11 +64,12 @@ digraph g {
 | 2     | c -> a | stuck.       |       |               |
 
 So even in an optimal game, D gets stuck.
+Therefore, M,a and K,1 are not bisimilar.
 
 Once we find a winning strategy for S no matter what D does, we can stop.
 
 ### b)
-◇ ◇ □ ⊥
+A formula distinguishing M,a and K,1 is: ◇ ◇ □ ⊥
 
 In two steps, we reach a blind state.