diff --git a/.obsidian/workspace.json b/.obsidian/workspace.json
index a02ef31..99d20e5 100644
--- a/.obsidian/workspace.json
+++ b/.obsidian/workspace.json
@@ -213,9 +213,10 @@
   },
   "active": "cdcc59f1bf6d4ae1",
   "lastOpenFiles": [
-    "Pasted image 20250505090603.png",
+    "Pasted image 20250505090959.png",
     "Concurrent Systems/slides/class 15.pdf",
     "Concurrent Systems/notes/15 - A formal language for LTSs.md",
+    "Pasted image 20250505090603.png",
     "Pasted image 20250505085454.png",
     "Pasted image 20250505084741.png",
     "Pasted image 20250505084556.png",
@@ -235,7 +236,6 @@
     "Pasted image 20250430175412.png",
     "Pasted image 20250430171336.png",
     "Concurrent Systems/slides/class 13.pdf",
-    "Concurrent Systems/notes/images/Pasted image 20250415082906.png",
     "Concurrent Systems/slides/class 14.pdf",
     "Concurrent Systems/slides/class 12.pdf",
     "HCIW/slides/HCI in the car.pdf",
diff --git a/Concurrent Systems/notes/15 - A formal language for LTSs.md b/Concurrent Systems/notes/15 - A formal language for LTSs.md
index bac9c0c..56fd666 100644
--- a/Concurrent Systems/notes/15 - A formal language for LTSs.md	
+++ b/Concurrent Systems/notes/15 - A formal language for LTSs.md	
@@ -44,4 +44,4 @@ To simplify the proof, let us modify the set of formulae by allowing conjunction
 
 *Inductive step:* Let's assume the thesis for every tree of height at most h. Let h+1 be the height of $\phi$. Let's distinguish on the outmost operator in $\phi$
 ![](../../Pasted%20image%2020250505090603.png)
-
+![](../../Pasted%20image%2020250505090959.png)
diff --git a/Pasted image 20250505090959.png b/Pasted image 20250505090959.png
new file mode 100644
index 0000000..28e6851
Binary files /dev/null and b/Pasted image 20250505090959.png differ