We solve a problem of Friedman by showing the existence of a logic stronger than first-order logic even for countable models, but still satisfying the general compactness theorem, assuming e.g. the ...