Coding 2024-01-31
I've got other stuff I want to put up entries about this week, but today was a lot, so instead I'm going to do some planning for the module separation I want to do.
I'm right now focusing on the total ordering relation, and for the fun(?) of it, I'd like to define that predicate in the context of other predicates applying to binary relations. Let's see which properties may be of interest:
- Reflexive and irreflexive
- Antisymmetric, asymmetric, symmetric
- Connected and strongly connected
- Dense
- Transitive and antitransitive
- Quasitransitive? Like, I can define it, but I'm not sure offhand what I'd do with it.
- Serial? Like, sure.
- Euclidean?
These properties should be a good baseline for putting things together, and then building more elaborate properties on top of them.
I'll try to get on that in the next few days. For now...
Good night.