*Below, all languages are finite for simplicity.*

This question is about generalizations of Barwise compactness for logics more complicated than $\mathcal{L}_{\omega_1,\omega}$: properties of the form "**For every 'small' $\mathcal{L}$-theory $T$, if every 'relatively simple' $D\subseteq T$ is satisfiable then $T$ is satisfiable**" (which I'll call "local compactness properties").

Both classical and Barwise compactnesses fit this paradigm: in classical compactness "small" means arbitrary and "relatively simple" means finite, and in Barwise compactness "small" means countable and $D$ is "simple relative to $T$" iff $D\in \mathbb{A}$ for every admissible structure $\mathbb{A}$ over which $T$ is $\Sigma_1$-definable (or r.e.).

Now *classical* compactness generalizes easily to appropriate higher logics, but Barwise compactness is more finicky - in particular, the "definition" of local compactness properties above is horribly vague and I see no natural precisiation of it. I'm interested in pinning down exactly what "local compactness property" ought to mean in whatever its appropriate general context is.

Towards that end, I'd like to put the cart ahead of the horse and ask:

- Are there (reasonably natural) examples of logics strictly stronger than $\mathcal{L}_{\omega_1,\omega}$ which satisfy some local compactness property?

Of course this is necessarily vague, but I hope the notion of local compactness property above is sufficiently clear that this will admit a non-silly answer. I'm especially interested in logics which contain $\mathcal{L}_{\omega_2,\omega}$ and in local compactness properties which are "computability-flavored," but I'll be happy with anything.