2 ms·
The somewhat-standard definition of the naturals (0 = {}, 1 = {0}, 2 = {0, 1}, 3 = {0, 1, 2}, ...) also maps min to set intersection. GCD, which someone else me
by thaumasiotes 7y ago
The somewhat-standard definition of the naturals (0 = {}, 1 = {0}, 2 = {0, 1}, 3 = {0, 1, 2}, ...) also maps min to set intersection. GCD, which someone else mentions in another comment, is very straightforwardly a set intersection problem.
The intuition here is that an operation throws away information that isn't relevant while keeping the relevant information. If you can't lose relevant information, you can't fail to be associative. Probably all such operations can be straightforwardly mapped to set intersection or set union. (Under the definition of the naturals given above, note that set union gives you the max operator.)