Strong completeness of the logic J

Abstract

We prove that the polymodal logic $\mathsf{J}$ is strongly complete with respect to \textit{$\mathsf{J}$-bouquets}, a topological refinement of its Kripke semantics. In particular, it is strongly topologically complete. This yields the following completeness result for the provability logic $\mathsf{GLP}$: a countable set of formulae $\Gamma$ is consistent with $\mathsf{GLP}$ if and only if there is a $\mathsf{J}$-bouquet $B$ and $r\in B$ such that $B,r⊩\mathsf{GLP}$ and $B,r⊩\Gamma$. In contrast, we exhibit counterexamples showing that $\mathsf{GLP}$ is not strongly complete with respect to Beklemishev-Gabelaia spaces.