abuseofnotation/category-theory-illustrated
1
1
Fork 0
mirror of https://github.com/abuseofnotation/category-theory-illustrated.git synced 2024-08-16 20:10:22 +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 00:52:56 +03:00 committed by GitHub
parent fd2d8d861d
commit ffcd803a0a
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

@ -435,7 +435,7 @@ By now you probably realized that the *and* and *or* operations are the bread an
![Order meet and joing](../05_logic/lattice_meet_join.svg)
Here comes the first criteria for an order to represent a logical system accurately - *it has to have $meet$ and $join$ operations for all elements*. Having two elements without a meet would mean that you would have a logical system where there are propositions for which you cannot say that one or the other is true. And this not how logic works, so our order has to have meets and joins for all elements. Incidentally we already know how such orders are called - they are called *lattices*.
Here comes the first criteria for an order to represent a logical system accurately - *it has to have $meet$ and $join$ operations for all elements*. Having two elements without a meet would mean that you would have a logical system where there are propositions for which you cannot say that one or the other is true. And this is not how logic works, so our order has to have meets and joins for all elements. Incidentally we already know how such orders are called - they are called *lattices*.
One important law of the *and* and *or* operations, that is not always present in the *meet*-s and *join*-s concerns the connection between the two, i.e. way that they distribute, over one another.