We say that an n-argument predicate $P\subset \Omega ^{n}$ is finite, if P is a finite set. Note that the set of individuals Ω is infinite! Finite predicates are ...

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 ...