2 ms·

If you enjoy this, you might find this meta list on "notation and thought" interesting: https://github.com/k-qy/notation https://github.com/k-qy/notation

• zetalyrae 4y ago
  I found this by Knuth on Iverson's notation interesting: https://www.maa.org/sites/default/files/images/images/upload_library/22/Ford/knuth403-422.pdf https://www.maa.org/sites/default/files/images/images/upload...
  • practal 4y ago
    Very interesting. I did never really look at the "Concrete Mathematics" book, so I missed this take by Knuth on turning a formula F into a term [F] by defining it as 1 if F is true, and 0 if F is false. Note that this cannot be done in first-order logic, as a formula cannot be part of a term. But it is not a problem in simply-typed higher-order logic, for example, and it is not a problem in abstraction logic, either.
• deleted 4y ago
  [deleted]
• samh748 4y ago
  Thank you so much for this!! The bit on "avoid ambiguity, or introduce useful ambiguity" is especially fascinating.