Who first explicitly noted that second-order logic is unaxiomatizable?

logic math-history

As every student now knows, second-order logical consequence is unaxiomatizable. (At least when we read the second-order quantifiers in the natural way, as running over all possible properties on the first-order domain).

Does anyone happen to know who, back in the glory days, was first really clear and explicit about this?


Leon Henkin stated this fact without reference in his 1950 paper in the JSL where he proved the completeness theorem for second-order logic in Henkin semantics [1].

1: http://www.jstor.org/stable/2266967

Related

The Noether-Deuring Theorem
Optimization of the area of a cross inscribed in a circle
Problem from "Differential topology" by Guillemin
Is the set of all polynomials in $\log(x)$ dense in $L^2[0,1]$?
Transferring properties from a category $\mathcal{D}$ to the functor category $[\mathcal{C}, \mathcal{D}]$
The Picard-Brauer short exact sequence
Decompose invertible matrix $A$ as $A = LPU$. (Artin, Chapter 2, Exercise M.11)
Distributions over locally compact Abelian groups: when can they be Fourier transformed?
Martin's Axiom and Choice principles
Limit of a sequence with indeterminate form
Correct notation or operator to remove elements from sequence
Which coefficients of the characteristic polynomial of the shape operator are isometric invariants?