More natural deduction and term sheet overview.

notes/.obsidian/plugins/obsidian-to-anki-plugin/data.json

@@ -562,7 +562,7 @@
     "_journal/2024-06/2024-06-21.md": "12e37e2c57abab09c781b32793fbbe1a",
     "startups/financing.md": "1978def9644211c989564faa3e4a56ea",
     "_journal/2024-06-24.md": "7fc0f4cd231ef7cd6aa2b556d1244cf4",
-    "_journal/2024-06/2024-06-23.md": "72e157bbf19d2d35843873ff9e900927",
+    "_journal/2024-06/2024-06-23.md": "9e23344bcc6c9ecc038c349022eaffd7",
     "_journal/2024-06-25.md": "fe70e3c260da1b2bb7535fb1eb656695",
     "_journal/2024-06/2024-06-24.md": "07e731eb482339db5f78c6e255c344a2",
     "_journal/2024-06-26.md": "9c5d7e6395496736f2f268e9fdba117f",
@@ -634,7 +634,9 @@
     "formal-system/abstract-rewriting.md": "8424314a627851c5b94be6163f64ba30",
     "_journal/2024-07-22.md": "dbbf1666c0ed939ce0ce339d41231b04",
     "_journal/2024-07/2024-07-21.md": "62c2651999371dd9ab10d964dac3d0f8",
-    "formal-system/proof-system/natural-deduction.md": "c910adfd2b6d162936db02d2c7f4563e"
+    "formal-system/proof-system/natural-deduction.md": "307f4c24526311a209d0686065ae601c",
+    "startups/term-sheet.md": "3b7fe2e4b067da47cdb2f0517c10e73f",
+    "startups/financing-rounds.md": "00a622fda2b4b442901bde2842309088"
   },
   "fields_dict": {
     "Basic": [

notes/_journal/2024-06/2024-06-23.md

@@ -9,5 +9,5 @@ title: "2024-06-23"
 - [ ] Korean (Read 1 Story)
 
 * Read chapter 4 ("Numbers") of "An Introduction to Ontology".
-* Notes on [[financing]] rounds.
+* Notes on [[financing-rounds]] rounds.
 * Additional notes on hash tables with [[closed-addressing#Chaining|chaining]] and independent uniform hashing.

notes/_journal/2024-07-22.md

@@ -8,4 +8,5 @@ title: "2024-07-22"
 - [ ] Sheet Music (10 min.)
 - [ ] Korean (Read 1 Story)
 
-* Beginning notes on [[natural-deduction|natural deduction]].
+* Beginning notes on [[natural-deduction|natural deduction]].
+* Read chapter 3 "Overview of the Term Sheet" of "Venture Deals".

notes/formal-system/proof-system/natural-deduction.md

@@ -68,6 +68,11 @@ Reference: Gries, David. *The Science of Programming*. Texts and Monographs in
 <!--ID: 1721655978506-->
 END%%
 
+### Negation
+
+For proposition $E1$, $$\neg{\text{-}}I{:} \quad \text{TODO}$$
+and $$\neg{\text{-}}E{:} \quad \text{TODO}$$
+
 ### Conjunction
 
 For propositions $E_1, \ldots, E_n$, $$\land{\text{-}}I{:} \quad \begin{array}{c} E_1, \ldots, E_n \\ \hline E_1 \land \cdots \land E_n \end{array}$$
@@ -174,6 +179,135 @@ Reference: Gries, David. *The Science of Programming*. Texts and Monographs in
 <!--ID: 1721656601613-->
 END%%
 
+### Implication
+
+For propositions $E1$ and $E2$, $${\Rightarrow}{\text{-}}I: \quad \text{TODO}$$
+and $${\Rightarrow}{\text{-}}E: \quad \begin{array}{c} E1 \Rightarrow E2, E1 \\ \hline E2 \end{array}$$
+
+%%ANKI
+Basic
+In natural deduction, how is implication introduction denoted?
+Back: As ${\Rightarrow}{\text{-}}I$.
+Reference: Gries, David. *The Science of Programming*. Texts and Monographs in Computer Science. New York: Springer-Verlag, 1981.
+<!--ID: 1721665510225-->
+END%%
+
+%%ANKI
+Basic
+In natural deduction, how is implication elimination denoted?
+Back: As ${\Rightarrow}{\text{-}}E$.
+Reference: Gries, David. *The Science of Programming*. Texts and Monographs in Computer Science. New York: Springer-Verlag, 1981.
+<!--ID: 1721665541946-->
+END%%
+
+%%ANKI
+Basic
+*Modus ponens* is associated with which propositional logic operator?
+Back: $\Rightarrow$
+Reference: Gries, David. *The Science of Programming*. Texts and Monographs in Computer Science. New York: Springer-Verlag, 1981.
+<!--ID: 1721665541949-->
+END%%
+
+%%ANKI
+Basic
+Does *modus ponens* correspond to an introduction or elimination rule?
+Back: Elimination.
+Reference: Gries, David. *The Science of Programming*. Texts and Monographs in Computer Science. New York: Springer-Verlag, 1981.
+<!--ID: 1721665541951-->
+END%%
+
+%%ANKI
+Cloze
+Natural deduction rule {1:$\Rightarrow$}-{1:$E$} is also known as {modus ponens}.
+Reference: Gries, David. *The Science of Programming*. Texts and Monographs in Computer Science. New York: Springer-Verlag, 1981.
+<!--ID: 1721665541953-->
+END%%
+
+%%ANKI
+Basic
+How is ${\Rightarrow}{\text{-}}E$ expressed in schematic notation?
+Back: $$\begin{array}{c} E1 \Rightarrow E2, E1 \\ \hline E2 \end{array}$$
+Reference: Gries, David. *The Science of Programming*. Texts and Monographs in Computer Science. New York: Springer-Verlag, 1981.
+<!--ID: 1721665510228-->
+END%%
+
+%%ANKI
+Basic
+How is *modus ponens* expressed in schematic notation?
+Back: $$\begin{array}{c} E1 \Rightarrow E2, E1 \\ \hline E2 \end{array}$$
+Reference: Gries, David. *The Science of Programming*. Texts and Monographs in Computer Science. New York: Springer-Verlag, 1981.
+<!--ID: 1721665541955-->
+END%%
+
+%%ANKI
+Basic
+Which natural deduction inference rule is used in the following? $$\begin{array}{c} P \Rightarrow Q, P \\ \hline R \end{array}$$
+Back: N/A.
+Reference: Gries, David. *The Science of Programming*. Texts and Monographs in Computer Science. New York: Springer-Verlag, 1981.
+<!--ID: 1721666244354-->
+END%%
+
+%%ANKI
+Basic
+Which natural deduction inference rule is used in the following? $$\begin{array}{c} P \Rightarrow Q, P \\ \hline Q \end{array}$$
+Back: ${\Rightarrow}{\text{-}}E$
+Reference: Gries, David. *The Science of Programming*. Texts and Monographs in Computer Science. New York: Springer-Verlag, 1981.
+<!--ID: 1721666244357-->
+END%%
+
+### Biconditional
+
+For propositions $E1$ and $E2$, $${\Leftrightarrow}{\text{-}}I: \quad \begin{array}{c} E1 \Rightarrow E2, E2 \Rightarrow E1 \\ \hline E1 \Leftrightarrow E2 \end{array}$$
+and $${\Leftrightarrow}{\text{-}}E: \quad \begin{array}{c} E1 \Leftrightarrow E2 \\ \hline E1 \Rightarrow E2, E2 \Rightarrow E1 \end{array}$$
+
+%%ANKI
+Basic
+In natural deduction, how is biconditional introduction denoted?
+Back: As ${\Leftrightarrow}{\text{-}}I$.
+Reference: Gries, David. *The Science of Programming*. Texts and Monographs in Computer Science. New York: Springer-Verlag, 1981.
+<!--ID: 1721666244359-->
+END%%
+
+%%ANKI
+Basic
+In natural deduction, how is biconditional elimination denoted?
+Back: As ${\Leftrightarrow}{\text{-}}E$.
+Reference: Gries, David. *The Science of Programming*. Texts and Monographs in Computer Science. New York: Springer-Verlag, 1981.
+<!--ID: 1721666244361-->
+END%%
+
+%%ANKI
+Basic
+How is ${\Leftrightarrow}{\text{-}}I$ expressed in schematic notation?
+Back: $$\begin{array}{c} E1 \Rightarrow E2, E2 \Rightarrow E1 \\ \hline E1 \Leftrightarrow E2 \end{array}$$
+Reference: Gries, David. *The Science of Programming*. Texts and Monographs in Computer Science. New York: Springer-Verlag, 1981.
+<!--ID: 1721666244362-->
+END%%
+
+%%ANKI
+Basic
+Which natural deduction inference rule is used in the following? $$\begin{array}{c} P \Rightarrow Q, Q \Rightarrow P \\ \hline Q \Leftrightarrow P \end{array}$$
+Back: ${\Leftrightarrow}{\text{-}}I$
+Reference: Gries, David. *The Science of Programming*. Texts and Monographs in Computer Science. New York: Springer-Verlag, 1981.
+<!--ID: 1721666244367-->
+END%%
+
+%%ANKI
+Basic
+How is ${\Leftrightarrow}{\text{-}}E$ expressed in schematic notation?
+Back: $$\begin{array}{c} E1 \Leftrightarrow E2 \\ \hline E1 \Rightarrow E2, E2 \Rightarrow E1 \end{array}$$
+Reference: Gries, David. *The Science of Programming*. Texts and Monographs in Computer Science. New York: Springer-Verlag, 1981.
+<!--ID: 1721666244366-->
+END%%
+
+%%ANKI
+Basic
+Which natural deduction inference rule is used in the following? $$\begin{array}{c} P \Leftrightarrow Q \\ \hline Q \Rightarrow P \end{array}$$
+Back: ${\Leftrightarrow}{\text{-}}E$
+Reference: Gries, David. *The Science of Programming*. Texts and Monographs in Computer Science. New York: Springer-Verlag, 1981.
+<!--ID: 1721666244364-->
+END%%
+
 ## Bibliography
 
 * Gries, David. *The Science of Programming*. Texts and Monographs in Computer Science. New York: Springer-Verlag, 1981.

notes/startups/financing-rounds.md

@@ -1,5 +1,5 @@
 ---
-title: Financing
+title: Financing Rounds
 TARGET DECK: Obsidian::H&SS
 FILE TAGS: startups::financing
 tags:

notes/startups/term-sheet.md

@@ -0,0 +1,59 @@
+---
+title: Term Sheet
+TARGET DECK: Obsidian::H&SS
+FILE TAGS: startups::term-sheet
+tags:
+  - startups
+  - term-sheet
+---
+
+## Overview
+
+According to Feld et al., there are only two things VCs actually care about when making investments:
+
+* **Economics**: the return investors ultimately get in a liquidity event;
+* **Control**: mechanisms that allow investors to exercise control over the business and/or veto decisions the company can make. 
+
+%%ANKI
+Basic
+According to Feld et al. what two things do VCs *actually* care about when making investments?
+Back: Economics and control.
+Reference: Brad Feld and Jason Mendelson, _Venture Deals_, 3rd ed., n.d.
+<!--ID: 1721667425673-->
+END%%
+
+%%ANKI
+Basic
+VCs care about the economics of an investment. What does that refer to?
+Back: The return investors will receive in case of a liquidity event.
+Reference: Brad Feld and Jason Mendelson, _Venture Deals_, 3rd ed., n.d.
+<!--ID: 1721667425676-->
+END%%
+
+%%ANKI
+Basic
+What terms found in a term sheet relate to "economics"?
+Back: Those related to the return investors receive in a liquidity event.
+Reference: Brad Feld and Jason Mendelson, _Venture Deals_, 3rd ed., n.d.
+<!--ID: 1721667425682-->
+END%%
+
+%%ANKI
+Basic
+VCs care about the control of an investment. What does that refer to?
+Back: The ability to push and/or veto decisions made by the company.
+Reference: Brad Feld and Jason Mendelson, _Venture Deals_, 3rd ed., n.d.
+<!--ID: 1721667425684-->
+END%%
+
+%%ANKI
+Basic
+What terms found in a term sheet relate to "control"?
+Back: Those that effect investors ability to push and/or veto decisions.
+Reference: Brad Feld and Jason Mendelson, _Venture Deals_, 3rd ed., n.d.
+<!--ID: 1721667425679-->
+END%%
+
+## Bibliography
+
+* Brad Feld and Jason Mendelson, _Venture Deals_, 3rd ed., n.d.