A condition, in two variants, is given such that if a property P satisfies this condition, then every logic which is at least as strong as first-order logic and can express P fails to have the compactness property. The result is used to prove that for a number of natural properties P speaking about automorphism groups or connectivity, every logic which is at least as strong as first-order logic and can express P fails to have the compactness property. The basic (...) idea underlying the results and examples presented here is that it is possible to construct a countable first-order theory T such that every model of T has a very rich automorphism group, but every finite subset T′ of T has a model which is rigid. (shrink)

This note concerns the model theoretic properties of logics extending the first-order logic with monadic second-order variables equipped with the stationarity quantifier. The eight variations of the strong downward Löwenheim–Skolem Theorem down to <ℵ2\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$<\aleph _2$$\end{document} for this logic with the interpretation of second-order variables as countable subsets of the structures are classified into four principles. The strongest of these four is shown to be equivalent to the conjunction of CH and the (...) Diagonal Reflection Principle for internally clubness of S. Cox. We show that a further strengthening of this SDLS and its variations follow from the Game Reflection Principle of B. König and its generalizations. (shrink)

We give an axiomatization of first‐order logic enriched with the almost‐everywhere quantifier over finitely additive measures. Using an adapted version of the consistency property adequate for dealing with this generalized quantifier, we show that such a logic is both strongly complete and enjoys Craig interpolation, relying on a (countable) model existence theorem. We also discuss possible extensions of these results to the almost‐everywhere quantifier over countably additive measures.