The Logic of Correct Models

Abstract

For each $n\in\mathbb{N}$, let $[n]φ$ mean "the sentence $φ$ is true in all $Σ_{n+1}$-correct transitive sets." Assuming Gödel's axiom $V = L$, we prove the following graded variant of Solovay's completeness theorem: the set of formulas valid under this interpretation is precisely the set of theorems of the linear provability logic GLP.3. We also show that this result is not provable in ZFC, so the hypothesis V = L cannot be removed. As part of the proof, we derive (in ZFC) the following purely modal-logical results which are of independent interest: the logic GLP.3 coincides with the logic of closed substitutions of GLP, and is the maximal non-degenerate, normal extension of GLP.

Figures (4)

• Figure 1: Impossible relations in the proof of Lemma \ref{['LemmaStratified']}.
• Figure 2: A hereditary linear $J_2$-frame.
• Figure 3: Comparability of $u$ and $v$ in the proof of Lemma \ref{['LemmaHereditaryLinear']}, Case III, assuming $m < k$ (left) and $k \leq m$ (right).
• Figure 4: Finding an $m$-extension $z$ of $y$ satisfying $\lnot\psi$ in the proof of Lemma \ref{['LemmaValuationCanoStar']} in cases IIa (left) and IIb (right).

Theorems & Definitions (40)

• Theorem A
• Theorem B
• Theorem C
• Definition 1
• Definition 2
• Theorem 3: $V = L$
• Definition 4
• Definition 5
• Lemma 6
• Definition 7