vault backup: 2023-09-19 13:39:51

.obsidian/workspace.json

@@ -18,8 +18,21 @@
                 "source": false
               }
             }
+          },
+          {
+            "id": "33ee032389b5d04b",
+            "type": "leaf",
+            "state": {
+              "type": "markdown",
+              "state": {
+                "file": "Notes/CP/T - Aula 2 - 19 Setembro.md",
+                "mode": "source",
+                "source": false
+              }
+            }
           }
-        ]
+        ],
+        "currentTab": 1
       }
     ],
     "direction": "vertical"
@@ -69,8 +82,7 @@
       }
     ],
     "direction": "horizontal",
-    "width": 300,
+    "width": 300
-    "collapsed": true
   },
   "right": {
     "id": "fe57fca15d81c25f",
@@ -86,7 +98,7 @@
             "state": {
               "type": "backlink",
               "state": {
-                "file": "Notes/MFES/T - Aula 2 - 18 Setembro 2023.md",
+                "file": "Notes/CP/T - Aula 2 - 19 Setembro.md",
                 "collapseAll": false,
                 "extraContext": false,
                 "sortOrder": "alphabetical",
@@ -103,7 +115,7 @@
             "state": {
               "type": "outgoing-link",
               "state": {
-                "file": "Notes/MFES/T - Aula 2 - 18 Setembro 2023.md",
+                "file": "Notes/CP/T - Aula 2 - 19 Setembro.md",
                 "linksCollapsed": false,
                 "unlinkedCollapsed": true
               }
@@ -126,7 +138,7 @@
             "state": {
               "type": "outline",
               "state": {
-                "file": "Notes/MFES/T - Aula 2 - 18 Setembro 2023.md"
+                "file": "Notes/CP/T - Aula 2 - 19 Setembro.md"
               }
             }
           }
@@ -150,10 +162,12 @@
       "obsidian-excalidraw-plugin:Create new drawing": false
     }
   },
-  "active": "201fe1705c33e116",
+  "active": "33ee032389b5d04b",
   "lastOpenFiles": [
-    "README.md",
     "Notes/MFES/T - Aula 2 - 18 Setembro 2023.md",
+    "Notes/CP/T - Aula 2 - 19 Setembro.md",
+    "Notes/CP",
+    "README.md",
     "Notes/MFES/MFES - UC Details.md",
     "2023-09-18.md",
     "MFES/T - Aula 2 - 18 Setembro 2023.md",

Notes/CP/T - Aula 2 - 19 Setembro.md

@@ -0,0 +1,7 @@
+## Conteúdo
+- cache em arquiteturas multicore
+- code profiling
+- instruction-level paralelism
+- Data dependency
+- branch prediction
+- 

Notes/MFES/T - Aula 2 - 18 Setembro 2023.md

@@ -67,16 +67,16 @@ A formula $F$ is:
    >  - $\Gamma \models G$ and $\Gamma$ finite iff $\models \land \Gamma \implies G$.
    >  
 
- - Let $\Gamma = { F_1, F_2, F_3,... }$ be a set of formulas.
 	 - $\Gamma$ is *consistent* or *satisfiable* iff there is an assignment that models $\Gamma$.
 	 - We say that $\Gamma$ is inconsistent or unsatisfiable iff there is not consistent and denote this by $\Gamma \models \bot$.
 
    > [!tip]+ Proposition
-   >  - {$F, \neg F$} \$models \bot$
+   >  - {$F, \neg F$} $\models \bot$
    >  - If $\Gamma \models \bot$ and $\Gamma \subseteq \Gamma '$, then $\Gamma ' \models \bot$
    >  - $\Gamma \models F$ iff $\Gamma, \neg F \models \bot$
 
-- Formula
+- Formula $G$ is a subformula of formula F if it occurs syntactically within F
+- Formula G is a strict subformula of F if G is a subformula of $F$ and $G \neg \equals F$
    
 ### 1.2.1 Basic Equivalences 
 1. $\neg \neg A \equiv A$