Permissivism, raising money, condition codes.

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

@@ -323,7 +323,7 @@
     "_journal/2024-03-18.md": "8479f07f63136a4e16c9cd07dbf2f27f",
     "_journal/2024-03/2024-03-17.md": "23f9672f5c93a6de52099b1b86834e8b",
     "set/directed-graph.md": "b4b8ad1be634a0a808af125fe8577a53",
-    "set/index.md": "40bb8c75770a626486bf40b68f2c8f3b",
+    "set/index.md": "ea5e92b9792a8e093bac259f85f1f829",
     "set/graphs.md": "55298be7241906cb6b61673cf0a2e709",
     "_journal/2024-03-19.md": "a0807691819725bf44c0262405e97cbb",
     "_journal/2024-03/2024-03-18.md": "63c3c843fc6cfc2cd289ac8b7b108391",
@@ -509,14 +509,14 @@
     "_journal/2024-06/2024-06-04.md": "52b28035b9c91c9b14cef1154c1a0fa1",
     "_journal/2024-06-06.md": "3f9109925dea304e7172df39922cc95a",
     "_journal/2024-06/2024-06-05.md": "b06a0fa567bd81e3b593f7e1838f9de1",
-    "set/relations.md": "b98d316d6e7595c5406352541cc7f9ee",
+    "set/relations.md": "1daa000a3b57d4335783cf4fd759c746",
     "_journal/2024-06-07.md": "795be41cc3c9c0f27361696d237604a2",
     "_journal/2024-06/2024-06-06.md": "db3407dcc86fa759b061246ec9fbd381",
     "_journal/2024-06-08.md": "b20d39dab30b4e12559a831ab8d2f9b8",
     "_journal/2024-06/2024-06-07.md": "c6bfc4c1e5913d23ea7828a23340e7d3",
     "lambda-calculus/alpha-conversion.md": "c9b7d60602e13e8a60d8784a859d4655",
     "lambda-calculus/index.md": "64efe9e4f6036d3f5b4ec0dc8cd3e7b9",
-    "x86-64/instructions/condition-codes.md": "f9ecc79ce8777d7ff17846eaf11a721c",
+    "x86-64/instructions/condition-codes.md": "efb0a3244139e91461c1b327d897206f",
     "x86-64/instructions/logical.md": "818428b9ef84753920dc61e5c2de9199",
     "x86-64/instructions/arithmetic.md": "271218d855e7291f119f96e91f582738",
     "x86-64/instructions/access.md": "c19bc3392cf493fcc9becf46c818cc50",
@@ -598,10 +598,10 @@
     "_journal/2024-07/2024-07-12.md": "6603ed8a3f9a9e87bf40e81b03e96356",
     "hashing/static.md": "3ec6eaee73fb9b599700f5a56b300b83",
     "hashing/addressing.md": "a78c0cbea13bc9deeadb2fc643c122ce",
-    "ontology/index.md": "c523aa6652b285a0f1c053cb77be6f85",
+    "ontology/index.md": "13e47f12ae5cf9816165c3e4f4090c1f",
     "ontology/permissivism.md": "5b66dd065aa66d5a2624eda032d75b94",
     "ontology/properties.md": "d417db0cecf11b1ed2e17f165d879fa5",
-    "_journal/2024-07-14.md": "3e04720086dca16f1c6b7412ec1706fd",
+    "_journal/2024-07-14.md": "9a74d2dd0f44db58e14f57c8908c3342",
     "_journal/2024-07/2024-07-13.md": "60e8eb09812660a2f2bf86ffafab5714"
   },
   "fields_dict": {

notes/_journal/2024-07-14.md

@@ -9,4 +9,6 @@ title: "2024-07-14"
 - [ ] Korean (Read 1 Story)
 
 * Notes on [[set#Cartesian Product|infinite Cartesian products]] and their relation to the [[set/index#Infinite Cartesian Product Form|axiom of choice]].
-* Initial notes on [[relations#Equivalence Relations|equivalence relations]].
+* Initial notes on [[relations#Equivalence Relations|equivalence relations]].
+* Read chapter 2 "How to Raise Money" in "Venture Deals".
+* Finished another read of "A Cardinal Worry for Permissive Metaontology".

notes/ontology/index.md

@@ -47,6 +47,13 @@ Reference: Nikk Effingham, _An Introduction to Ontology_ (Cambridge: Polity Pres
 <!--ID: 1720912238066-->
 END%%
 
+%%ANKI
+Cloze
+{Mereology} is the {philosophical study of part-whole relationships}.
+Reference: Nikk Effingham, _An Introduction to Ontology_ (Cambridge: Polity Press, 2013).
+<!--ID: 1720998380912-->
+END%%
+
 %%ANKI
 Basic
 What does Effingham mean when saying "concreta" and "abstracta" are terms of art?

notes/set/index.md

@@ -173,6 +173,46 @@ Reference: Herbert B. Enderton, *Elements of Set Theory* (New York: Academic Pre
 <!--ID: 1716494526269-->
 END%%
 
+%%ANKI
+Basic
+What German term is used alternatively for "atoms"?
+Back: Urelements.
+Reference: Simon Hewitt, “A Cardinal Worry for Permissive Metaontology,” _Metaphysica_ 16, no. 2 (September 18, 2015): 159–65, [https://doi.org/10.1515/mp-2015-0009](https://doi.org/10.1515/mp-2015-0009).
+<!--ID: 1720998380904-->
+END%%
+
+%%ANKI
+Basic
+Can sets be members of urelements?
+Back: No.
+Reference: Simon Hewitt, “A Cardinal Worry for Permissive Metaontology,” _Metaphysica_ 16, no. 2 (September 18, 2015): 159–65, [https://doi.org/10.1515/mp-2015-0009](https://doi.org/10.1515/mp-2015-0009).
+<!--ID: 1720998380907-->
+END%%
+
+%%ANKI
+Basic
+Can urelements be members of sets?
+Back: Yes.
+Reference: Simon Hewitt, “A Cardinal Worry for Permissive Metaontology,” _Metaphysica_ 16, no. 2 (September 18, 2015): 159–65, [https://doi.org/10.1515/mp-2015-0009](https://doi.org/10.1515/mp-2015-0009).
+<!--ID: 1720998380909-->
+END%%
+
+%%ANKI
+Basic
+Can urelements be members of urelements?
+Back: No.
+Reference: Simon Hewitt, “A Cardinal Worry for Permissive Metaontology,” _Metaphysica_ 16, no. 2 (September 18, 2015): 159–65, [https://doi.org/10.1515/mp-2015-0009](https://doi.org/10.1515/mp-2015-0009).
+<!--ID: 1720998380910-->
+END%%
+
+%%ANKI
+Basic
+Can sets be members of sets?
+Back: Yes.
+Reference: Simon Hewitt, “A Cardinal Worry for Permissive Metaontology,” _Metaphysica_ 16, no. 2 (September 18, 2015): 159–65, [https://doi.org/10.1515/mp-2015-0009](https://doi.org/10.1515/mp-2015-0009).
+<!--ID: 1720998380911-->
+END%%
+
 %%ANKI
 Cloze
 An {atom} is to set theory as an {atomic} logical statement is to propositional logic. 

notes/set/relations.md

@@ -395,6 +395,13 @@ Reference: Herbert B. Enderton, *Elements of Set Theory* (New York: Academic Pre
 <!--ID: 1718465870483-->
 END%%
 
+%%ANKI
+Cloze
+For any binary relation $R$, $R \subseteq$ {1:$\mathop{\text{dom} }R$} $\times$ {1:$\mathop{\text{ran} }R$} $\subseteq$ {2:$\mathop{\text{fld} }R$} $\times$ {2:$\mathop{\text{fld} }R$}.
+Reference: Herbert B. Enderton, *Elements of Set Theory* (New York: Academic Press, 1977).
+<!--ID: 1720991126990-->
+END%%
+
 ## n-ary Relations
 
 We define ordered triples as $\langle x, y, z \rangle = \langle \langle x, y \rangle, z \rangle$. We define ordered quadruples as $\langle x_1, x_2, x_3, x_4 \rangle = \langle \langle \langle x_1, x_2 \rangle, x_3 \rangle, x_4 \rangle$. This idea generalizes to $n$-tuples. As a special case, we define the $1$-tuple $\langle x \rangle = x$.

notes/x86-64/instructions/condition-codes.md

@@ -94,12 +94,12 @@ END%%
 
 ## SET
 
-| Instruction | Synonym | Effect   | Description          |
+| Instruction | Synonym | Effect     | Description          |
-| ----------- | ------- | -------- | -------------------- |
+| ----------- | ------- | ---------- | -------------------- |
-| `sete`      | `setz`  | D <- ZF  | Equal / zero         |
+| `sete`      | `setz`  | `D <- ZF`  | Equal / zero         |
-| `setne`     | `setnz` | D <- ~ZF | Not equal / not zero |
+| `setne`     | `setnz` | `D <- ~ZF` | Not equal / not zero |
-| `sets`      |         | D <- SF  | Negative             |
+| `sets`      |         | `D <- SF`  | Negative             |
-| `setns`     |         | D <- ~SF | Nonnegative          |
+| `setns`     |         | `D <- ~SF` | Nonnegative          |
 
 %%ANKI
 Basic
@@ -194,6 +194,69 @@ Reference: Bryant, Randal E., and David O'Hallaron. *Computer Systems: A Program
 <!--ID: 1720793027151-->
 END%%
 
+%%ANKI
+Basic
+What condition code(s) does `sete` refer to?
+Back: `ZF`
+Reference: Bryant, Randal E., and David O'Hallaron. *Computer Systems: A Programmer's Perspective*. Third edition, Global edition. Always Learning. Pearson, 2016.
+<!--ID: 1720992217906-->
+END%%
+
+%%ANKI
+Basic
+When value does `setz` put in its specified destination?
+Back: `ZF`
+Reference: Bryant, Randal E., and David O'Hallaron. *Computer Systems: A Programmer's Perspective*. Third edition, Global edition. Always Learning. Pearson, 2016.
+<!--ID: 1720992217909-->
+END%%
+
+%%ANKI
+Basic
+What condition code(s) does `setnz` refer to?
+Back: `ZF`
+Reference: Bryant, Randal E., and David O'Hallaron. *Computer Systems: A Programmer's Perspective*. Third edition, Global edition. Always Learning. Pearson, 2016.
+<!--ID: 1720992217911-->
+END%%
+
+%%ANKI
+Basic
+When value does `setne` put in its specified destination?
+Back: `~ZF`
+Reference: Bryant, Randal E., and David O'Hallaron. *Computer Systems: A Programmer's Perspective*. Third edition, Global edition. Always Learning. Pearson, 2016.
+<!--ID: 1720992217913-->
+END%%
+
+%%ANKI
+Basic
+What condition code(s) does `sets` refer to?
+Back: `SF`
+Reference: Bryant, Randal E., and David O'Hallaron. *Computer Systems: A Programmer's Perspective*. Third edition, Global edition. Always Learning. Pearson, 2016.
+<!--ID: 1720992217915-->
+END%%
+
+%%ANKI
+Basic
+When value does `setz` put in its specified destination?
+Back: `SF`
+Reference: Bryant, Randal E., and David O'Hallaron. *Computer Systems: A Programmer's Perspective*. Third edition, Global edition. Always Learning. Pearson, 2016.
+END%%
+
+%%ANKI
+Basic
+What condition code(s) does `setns` refer to?
+Back: `SF`
+Reference: Bryant, Randal E., and David O'Hallaron. *Computer Systems: A Programmer's Perspective*. Third edition, Global edition. Always Learning. Pearson, 2016.
+<!--ID: 1720992217916-->
+END%%
+
+%%ANKI
+Basic
+When value does `setns` put in its specified destination?
+Back: `~SF`
+Reference: Bryant, Randal E., and David O'Hallaron. *Computer Systems: A Programmer's Perspective*. Third edition, Global edition. Always Learning. Pearson, 2016.
+<!--ID: 1720992217917-->
+END%%
+
 ## Bibliography
 
 * Bryant, Randal E., and David O'Hallaron. *Computer Systems: A Programmer's Perspective*. Third edition, Global edition. Always Learning. Pearson, 2016.