-
Notifications
You must be signed in to change notification settings - Fork 149
Basic Order Theory #1154
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Basic Order Theory #1154
Conversation
Rename preorder to proset; rename strict poset to quoset (quasiorder) and add strict orders as quasiorders with weak linearity
Note that while this is not immediately related to #1181, it does help set up some additional foundational stuff for orderings in general, such as basic definitions of lattices and meets/joins. |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Thanks for the contribution! And sorry for the long waiting time.
Looks all good to me.
Introduces basic order theory (basics of lattices, downsets, upsets, poset closures; defines galois connections as well). Also cleans up a couple of order-related files for naturals and rationals and adds some useful lemmas to some algebra structures for use later. Renames and cleans up the various orderings as well. Also proves that embeddings form a complete lattice. Defines preimages as well.