I have read that a second-order logic can help one define equality by quantifying over all predicates such as what is done in the following definition:
(x=y):⟺[∀P:P(x)⟺P(y)]
By contrast a first-order logic with identity would define "=" as a primitive logical symbol.
Besides this benefit, but using it as an example of a benefit, what are other uses or benefits of a second-order logic over a first-order logic?
Han de Bruijn (https://math.stackexchange.com/users/96057/han-de-bruijn), Leibniz' Law and that good old riddle, URL (version: 2013-12-18): https://math.stackexchange.com/q/608947
