diff --git a/notes/.obsidian/plugins/obsidian-to-anki-plugin/data.json b/notes/.obsidian/plugins/obsidian-to-anki-plugin/data.json index e7117ea..e7bed76 100644 --- a/notes/.obsidian/plugins/obsidian-to-anki-plugin/data.json +++ b/notes/.obsidian/plugins/obsidian-to-anki-plugin/data.json @@ -510,7 +510,7 @@ "_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": "a77290da08db947ace9c6c3374b4f12c", + "set/relations.md": "6063a3a4be5b5983d17600b18220897a", "_journal/2024-06-07.md": "795be41cc3c9c0f27361696d237604a2", "_journal/2024-06/2024-06-06.md": "db3407dcc86fa759b061246ec9fbd381", "_journal/2024-06-08.md": "b20d39dab30b4e12559a831ab8d2f9b8", @@ -601,7 +601,7 @@ "hashing/addressing.md": "e97c1905cdf5787d94c857fb5f22be8a", "ontology/index.md": "15e97e3e8068660314499fb4d1bdd53e", "ontology/permissivism.md": "643e815a79bc5c050cde9f996aa44ef5", - "ontology/properties.md": "d417db0cecf11b1ed2e17f165d879fa5", + "ontology/properties.md": "91ece501551c444afcd119d7197958ef", "_journal/2024-07-14.md": "9a74d2dd0f44db58e14f57c8908c3342", "_journal/2024-07/2024-07-13.md": "60e8eb09812660a2f2bf86ffafab5714", "_journal/2024-07-15.md": "462fb4294cbbe8855071c638351df147", @@ -634,7 +634,7 @@ "formal-system/abstract-rewriting.md": "8424314a627851c5b94be6163f64ba30", "_journal/2024-07-22.md": "d2ca7ce0bbeef76395fee33c9bf36e9d", "_journal/2024-07/2024-07-21.md": "62c2651999371dd9ab10d964dac3d0f8", - "formal-system/proof-system/natural-deduction.md": "48e6907912c293a26b08ecbfd76ff058", + "formal-system/proof-system/natural-deduction.md": "9d935708822a59134176d2d707025f6c", "startups/term-sheet.md": "6b6152af78addb3fe818a7fc9d375fbf", "startups/financing-rounds.md": "00a622fda2b4b442901bde2842309088", "_journal/2024-07-23.md": "35e18a1d9a8dd0a97e1d9898bc1d8f01", @@ -646,7 +646,9 @@ "_journal/2024-07-26.md": "2dfc0c1049e88c75e91a3130819d1608", "_journal/2024-07/2024-07-25.md": "087a54db6fb7003994aa409c0b2ca379", "_journal/2024-07-27.md": "1ab2b013a217143a91c8e6de068e9f6f", - "_journal/2024-07/2024-07-26.md": "c167f734a5037e1a5537b1e95ca6790f" + "_journal/2024-07/2024-07-26.md": "c167f734a5037e1a5537b1e95ca6790f", + "_journal/2024-07-28.md": "2aafb514903eca2b842487c573c1753a", + "_journal/2024-07/2024-07-27.md": "7c48690746d8320494e29e92390eb6ee" }, "fields_dict": { "Basic": [ diff --git a/notes/_journal/2024-07-28.md b/notes/_journal/2024-07-28.md new file mode 100644 index 0000000..239f5ac --- /dev/null +++ b/notes/_journal/2024-07-28.md @@ -0,0 +1,9 @@ +--- +title: "2024-07-28" +--- + +- [x] Anki Flashcards +- [x] KoL +- [x] OGS +- [ ] Sheet Music (10 min.) +- [ ] Korean (Read 1 Story) \ No newline at end of file diff --git a/notes/_journal/2024-07-27.md b/notes/_journal/2024-07/2024-07-27.md similarity index 66% rename from notes/_journal/2024-07-27.md rename to notes/_journal/2024-07/2024-07-27.md index 2eaa37c..1b237bf 100644 --- a/notes/_journal/2024-07-27.md +++ b/notes/_journal/2024-07/2024-07-27.md @@ -9,4 +9,5 @@ title: "2024-07-27" - [ ] Korean (Read 1 Story) * Finished reading section 11.3 "Hash functions" in "Introduction to Algorithms". -* High-level notes on open addressing. \ No newline at end of file +* High-level notes on open addressing. +* Read chapters 1 and 2 of "Semantic Web for the Working Ontologist". \ No newline at end of file diff --git a/notes/formal-system/proof-system/natural-deduction.md b/notes/formal-system/proof-system/natural-deduction.md index d1296f7..a6e7739 100644 --- a/notes/formal-system/proof-system/natural-deduction.md +++ b/notes/formal-system/proof-system/natural-deduction.md @@ -55,7 +55,7 @@ END%% %%ANKI Basic With respect to propositional logic, how are natural deduction's inference rules categorized into five? -Back: As an introduction and elimination rule per propositional logic operators. +Back: As an introduction and elimination rule per propositional logic operator. Reference: Gries, David. *The Science of Programming*. Texts and Monographs in Computer Science. New York: Springer-Verlag, 1981. END%% @@ -165,7 +165,7 @@ END%% %%ANKI Basic -In natural deduction, how is disjunction elimination denoted?? +In natural deduction, how is disjunction elimination denoted? Back: As $\lor{\text{-}}E$. Reference: Gries, David. *The Science of Programming*. Texts and Monographs in Computer Science. New York: Springer-Verlag, 1981. @@ -174,7 +174,7 @@ END%% %%ANKI Basic How is $\lor{\text{-}}I$ expressed in schematic notation? -Back: $$\lor{\text{-}}I{:} \quad \begin{array}{c} E_i \\ \hline E_1 \lor \cdots \lor E_n \end{array}$$ +Back: $$\begin{array}{c} E_i \\ \hline E_1 \lor \cdots \lor E_n \end{array}$$ Reference: Gries, David. *The Science of Programming*. Texts and Monographs in Computer Science. New York: Springer-Verlag, 1981. END%% @@ -182,7 +182,7 @@ END%% %%ANKI Basic How is $\lor{\text{-}}E$ expressed in schematic notation? -Back: $$\lor{\text{-}}E{:} \quad \begin{array}{c} E_1 \lor \cdots \lor E_n, E_1 \Rightarrow E, \ldots, E_n \Rightarrow E \\ \hline E \end{array}$$ +Back: $$\begin{array}{c} E_1 \lor \cdots \lor E_n, E_1 \Rightarrow E, \ldots, E_n \Rightarrow E \\ \hline E \end{array}$$ Reference: Gries, David. *The Science of Programming*. Texts and Monographs in Computer Science. New York: Springer-Verlag, 1981. END%% @@ -248,13 +248,6 @@ Reference: Gries, David. *The Science of Programming*. Texts and Monographs in 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. - -END%% - %%ANKI Basic How is ${\Rightarrow}{\text{-}}E$ expressed in schematic notation? diff --git a/notes/ontology/properties.md b/notes/ontology/properties.md index d0cd9d1..a730d75 100644 --- a/notes/ontology/properties.md +++ b/notes/ontology/properties.md @@ -56,7 +56,7 @@ END%% %%ANKI Basic -Suppose all properties are self-instantiating? What must be said about *being honest*? +Suppose all properties are self-instantiating. What must be said about *being honest*? Back: The property *being honest* is honest. Reference: Francesco Orilia and Michele Paolini Paoletti, “Properties,” in _The Stanford Encyclopedia of Philosophy_, ed. Edward N. Zalta, Spring 2022 (Metaphysics Research Lab, Stanford University, 2022), [https://plato.stanford.edu/archives/spr2022/entries/properties/](https://plato.stanford.edu/archives/spr2022/entries/properties/). diff --git a/notes/set/relations.md b/notes/set/relations.md index d1685e7..e7c62a7 100644 --- a/notes/set/relations.md +++ b/notes/set/relations.md @@ -483,7 +483,7 @@ END%% %%ANKI Basic A $1$-ary relation on $A$ is a subset of what Cartesian product? -Back: N/A +Back: N/A. Reference: Herbert B. Enderton, *Elements of Set Theory* (New York: Academic Press, 1977). END%%