abuseofnotation/category-theory-illustrated
1
1
Fork 0
mirror of https://github.com/abuseofnotation/category-theory-illustrated.git synced 2024-10-05 13:27:13 +03:00
Code Issues Packages Projects Releases Wiki Activity

typo fix 05_logic.md

Browse Source
This commit is contained in:
Grigoriy Beziuk 2024-03-04 01:01:03 +03:00 committed by GitHub
parent ffcd803a0a
commit 044c0743c9
No known key found for this signature in database
GPG Key ID: B5690EEEBB952194
1 changed files with 1 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
_chapters/05_logic.md
View File

@ -497,7 +497,7 @@ So this is the final condition for an order/lattice to be a representation of lo
Without being too formal, let's try to test if this definition captures the concept correctly by examining a few special cases.
For example, let's take $A$ and $B$ to be the same object. In this case, ($A → B$) (or ($A → A$) if you want to be pedantic) would be the topmost object $X$ for which the criteria given by the formula $A ∧ X → A$ is satisfied. But in this case the formula is *always satisfied* as the *meet* of $A$ and any other object would always be below $A$. So this formula is always for all $X$. The topmost object that fits it is, then, the topmost object out there i.e. $True$.
For example, let's take $A$ and $B$ to be the same object. In this case, ($A → B$) (or ($A → A$) if you want to be pedantic) would be the topmost object $X$ for which the criteria given by the formula $A ∧ X → A$ is satisfied. But in this case the formula is *always satisfied* as the *meet* of $A$ and any other object would always be below $A$. So this formula is always satisfied for all $X$. The topmost object that fits it is, then, the topmost object out there i.e. $True$.
![Implies identity](../05_logic/implies_identity.svg)