diff --git a/.obsidian/workspace.json b/.obsidian/workspace.json
index c5f57b2..c261faa 100644
--- a/.obsidian/workspace.json
+++ b/.obsidian/workspace.json
@@ -8,66 +8,37 @@
         "type": "tabs",
         "children": [
           {
-            "id": "51157f32453cba69",
+            "id": "105f7a61963f10e7",
             "type": "leaf",
             "state": {
               "type": "markdown",
               "state": {
-                "file": "Concurrent Systems/notes/5 - Software Transactional Memory.md",
+                "file": "Concurrent Systems/notes/6a -.md",
                 "mode": "source",
                 "source": false
               },
               "icon": "lucide-file",
-              "title": "5 - Software Transactional Memory"
+              "title": "6a -"
             }
           },
           {
-            "id": "cb0eda06ef87cab2",
+            "id": "6c846cff8fe1d071",
             "type": "leaf",
             "state": {
               "type": "pdf",
               "state": {
-                "file": "Concurrent Systems/slides/class 4.pdf",
-                "page": 14,
-                "left": -227,
-                "top": 577,
-                "zoom": 0.9
+                "file": "Concurrent Systems/slides/class 6.pdf",
+                "page": 6,
+                "left": -16,
+                "top": 275,
+                "zoom": 0.9236935866983375
               },
               "icon": "lucide-file-text",
-              "title": "class 4"
-            }
-          },
-          {
-            "id": "16a4a3f7d00f9524",
-            "type": "leaf",
-            "state": {
-              "type": "markdown",
-              "state": {
-                "file": "Concurrent Systems/notes/3b - Aravind's algorithm and improvements.md",
-                "mode": "source",
-                "source": false
-              },
-              "icon": "lucide-file",
-              "title": "3b - Aravind's algorithm and improvements"
-            }
-          },
-          {
-            "id": "40e484b34503a47c",
-            "type": "leaf",
-            "state": {
-              "type": "pdf",
-              "state": {
-                "file": "Concurrent Systems/slides/class 3.pdf",
-                "page": 8,
-                "left": -11,
-                "top": 430,
-                "zoom": 1.35124703087886
-              },
-              "icon": "lucide-file-text",
-              "title": "class 3"
+              "title": "class 6"
             }
           }
-        ]
+        ],
+        "currentTab": 1
       }
     ],
     "direction": "vertical"
@@ -239,8 +210,9 @@
       "companion:Toggle completion": false
     }
   },
-  "active": "51157f32453cba69",
+  "active": "6c846cff8fe1d071",
   "lastOpenFiles": [
+    "Concurrent Systems/notes/6a -.md",
     "Concurrent Systems/notes/6 - Atomicity.md",
     "Concurrent Systems/notes/5 - Software Transactional Memory.md",
     "Concurrent Systems/notes/4b - Monitors.md",
diff --git a/Concurrent Systems/notes/6 - Atomicity.md b/Concurrent Systems/notes/6 - Atomicity.md
index 3072db6..cc7aa09 100644
--- a/Concurrent Systems/notes/6 - Atomicity.md	
+++ b/Concurrent Systems/notes/6 - Atomicity.md	
@@ -101,6 +101,4 @@ Allora $$\hat{H}|_p = \hat{S}_p$$
 ovverosia, se proiettiamo H e S solo per le operazioni eseguite da un solo processo $p$, allora gli storici saranno uguali.
 
 Infine, si ha che $$\to_H \space \subseteq \space \to \space \subseteq \space \to' \space = \space \to_S$$
-perché un ordinamento topologico rispetta tutti i vincoli e quindi lo posso vedere come una linearizzazione.
-> [!PDF|red] class 6, p.6>  we would have a cycle of length > 
-> we would contraddict op2 ->x op3
\ No newline at end of file
+perché un ordinamento topologico rispetta tutti i vincoli e quindi lo posso vedere come una linearizzazione.
\ No newline at end of file
diff --git a/Concurrent Systems/notes/6a -.md b/Concurrent Systems/notes/6a -.md
new file mode 100644
index 0000000..e69de29