Skip to main content
1 of 7
Noah Schweber
  • 20.5k
  • 10
  • 110
  • 331

How strong is this "modal definability principle"?

Throughout, we work in the class theory $\mathsf{MK+ETR_{Ord}}$ (although I'm open to tweaking this), "logic" means "set-sized regular logic whose semantics is definable over $V$," and "$\mathcal{J}\approx\mathcal{K}$" means that the logics $\mathcal{J}$ and $\mathcal{K}$ are equivalent in the sense that for every $\mathcal{J}$-sentence $\varphi$ there is a $\mathcal{K}$-sentence $\psi$ with the same model class and conversely.


I'm interested in two (types of) transformations of logics:

First, we have the various infinitarizations: given an infinite cardinal $\kappa$ and a logic $\mathcal{J}$, let $\mathbb{I}_\kappa(\mathcal{J})$ be the smallest logic containing $\mathcal{J}$ and closed under Boolean combinations of size $<\kappa$ and quantification over tuples of size $<\kappa$. (Technically this definition only works well if $\kappa$ is regular; when $\kappa$ is singular, the right definition is $\mathbb{I}_\kappa(\mathcal{J})=\bigcup_{cf(\lambda)=\lambda<\kappa}\mathbb{I}_\lambda(\mathcal{J})$.)

Second, we have modalization. Given a logic $\mathcal{J}$, let $\mathbb{M}(\mathcal{J})$ be the smallest logic $\mathcal{K}$ such that $\mathcal{J}\subseteq\mathcal{K}$ and, for every $\mathcal{K}$-sentence $\varphi$, there is a $\mathcal{K}$-sentence $\Box\varphi$ with the property that for every structure $\mathfrak{A}$ we have $\mathfrak{A}\models_\mathcal{K}\Box\varphi$ iff $\mathfrak{B}\models_\mathcal{K}\varphi$ for every $\mathfrak{B}$ containing $\mathfrak{A}$ as a substructure.

By an argument$^1$ similar to the proof of the Los-Tarski theorem, we have $\mathbb{M}(\mathcal{L}_{\theta,\theta})\approx\mathcal{L}_{\theta,\theta}$ whenever $\theta$ is a limit of strongly compact cardinals, giving a conditional answer to Questions 57/58 of Hamkins/Woloszyn. Moreover, assuming Vopenka's Principle the same argument can be extended to arbitrary logics, yielding the following:

$(\star)$ For every logic $\mathcal{J}$ and every infinite cardinal $\kappa$ there is a logic $\mathcal{K}$ satisfying $$\mathcal{K}\approx\mathbb{M}(\mathcal{K})\approx\mathbb{I}_\kappa(\mathcal{K}).$$

This uses Makowsky's theorem that VP implies the existence of strong compactness numbers for all logics. Moreover, there is some heuristic evidence (namely this MO answer of Trevor Wilson) that we can't replace VP with anything weaker without substantially changing this argument. My question is whether this is in fact the case:

Over the base theory $\mathsf{MK+ETR_{Ord}}$, does $(\star)$ have any nontrivial consistency strength?


$^1$For completeness, let me sketch the argument mentioned above; I can add details if anyone is interested.

Suppose $\theta$ is a limit of strongly compact cardinals and $\varphi\in\mathcal{L}_{\theta,\theta}$; I'll show that $\Box\varphi$ is semantically equivalent to an $\mathcal{L}_{\theta,\theta}$-sentence (the rest of the argument is a routine induction on complexity, and a rephrasing of this paragraph to be about formulas rather than sentences). Let $\kappa$ be a strongly compact cardinal such that $\theta\in\mathcal{L}_{\kappa,\kappa}$, and let $\mathbb{S}$ be the set of $\mathcal{L}_{\kappa,\kappa}$-sentences which are purely existential and inconsistent with $\neg\varphi$. The disjunction $\sigma:=\bigvee\mathbb{S}$ is again an $\mathcal{L}_{\theta,\theta}$-sentence; I claim $\sigma$ is semantically equivalent to $\Box\varphi$. Trivially $\mathfrak{A}\models\sigma\implies\mathfrak{A}\models\Box\varphi$. In the other direction, suppose $\mathfrak{B}\models\Box\varphi$. Then the atomic diagram of $\mathfrak{B}$ is inconsistent with $\neg\varphi$. By strong compactness of $\kappa$, this means that there is a subset of the atomic diagram of $\mathfrak{B}$ of cardinality $<\kappa$ which is inconsistent with $\neg\varphi$. But this means $\mathfrak{A}\models\sigma$.

Noah Schweber
  • 20.5k
  • 10
  • 110
  • 331