1 Introduction
There has been a recent interest in hierarchical generalizations of classic incompleteness results [Reference Chao and Seraji5, Reference Kikuchi and Kurahashi23, Reference Kurahashi27, Reference Salehi and Seraji40]. A sample result, generalizing the Gödel–Rosser incompleteness theorem, and independently proved by both Kikuchi and Kurahashi [Reference Kikuchi and Kurahashi23] and Salehi and Seraji [Reference Salehi and Seraji40], is:
Theorem 1.1. Let $\mathrm {T}$ be a $\Sigma _{n+1}$ definable, $\Sigma _n$ sound extension of $\mathrm {PA}$ . Then there is a $\Pi _{n+1}$ sentence that is undecidable in $\mathrm {T}$ .
In this paper I argue that such hierarchical generalizations can often be obtained from the original proofs by replacing certain principles used in the proofs by appropriately formulated hierarchical versions, while the essence of the arguments remains the same. The hierarchical principles, once appropriately formulated, are in turn often provable by appropriate generalizations of the core concepts employed in the proofs of the ordinary ones, but even so, there is no single source to which to turn for them. Both Smoryński [Reference Smoryński45] and Beklemishev [Reference Beklemishev1] give good partial accounts of the syntactical side, and Poizat [Reference Poizat35] gives a hierarchical perspective on the basic model theory of arithmetic, including modeltheoretic proofs of hierarchical versions of Gödel’s first and second incompleteness theorems. Still, I find certain aspects lacking. With this in mind, one aim of this paper is to collect a number of principles that may be useful to the reader who herself wishes to prove hierarchical incompleteness results without having to reinvent the wheel.
These principles are then put to use to prove a number of general incompleteness results for arithmetically definable extensions of fragments of $\mathrm {PA}$ . The goal is not to prove the sharpest or most general results (in fact some of the results follow from each other), but rather to exemplify how the hierarchical principles enter into more or less wellknown proof methods. Even so, the results presented here improve on some results of Chao and Seraji [Reference Chao and Seraji5], Kikuchi and Kurahashi [Reference Kikuchi and Kurahashi23], and Salehi and Seraji [Reference Salehi and Seraji40], and sharpen some of Blanck [Reference Blanck3], Hamkins [Reference Hamkins18], Lindström [Reference Lindström28], and Woodin [Reference Woodin, Heller and Woodin48]. These sharpenings are in terms of gauging the amount of induction needed for the proofs, bringing the (in this particular subfield largely ignored) fragmentsofarithmetic perspective to attention.
In order to state the results in a more general form, I have chosen to consider only extensions of $\mathrm {I}\Delta _0 + \mathrm {exp}$ , although under the somewhat unusual name $\mathrm {I}\Sigma _0 + \mathrm {exp}$ . This allows for formulating results for extensions of, e.g., $\mathrm {I}\Sigma _n + \mathrm {exp}$ , ensuring that partial satisfaction predicates are well behaved even for $n=0$ . While it is sometimes possible to push the background theory below $\mathrm {I}\Sigma _0 + \mathrm {exp}$ , I have refrained from doing so, to instead focus on the more general hierarchical picture.
2 Notation and conventions
The expressions $\exists x \leq t \phi (x)$ and $\forall x \leq t \phi (x)$ are used as shorthand for $\exists x (x \leq t \land \phi (x))$ and $\forall x (x\leq t \rightarrow \phi (x))$ , where t is some term in the language of arithmetic. The initial quantifiers of these formulae are bounded and a formula containing only bounded quantifiers is a bounded formula. Let $\Delta _0 = \Sigma _0 = \Pi _0$ be the class of bounded formulae.
The arithmetical hierarchy is defined as follows. A formula is $\Sigma _{n+1}$ iff it is of the form $\exists x_1 \dots x_m \pi (x_1,\dots ,x_m)$ where $\pi $ is a $\Pi _n$ formula (that may contain other variables than $x_1,\dots ,x_m$ ). Similarly, a formula is $\Pi _{n+1}$ iff it is of the form $\forall x_1 \dots x_m \sigma (x_1,\dots ,x_m)$ where $\sigma $ is a $\Sigma _n$ formula. $\Delta _n(\mathcal {M})$ ( $\Delta _n(\mathrm {T})$ ) is the set of $\Sigma _n$ formulae that are equivalent to $\Pi _n$ formulae in a given model $\mathcal {M}$ (theory $\mathrm {T}$ ). Throughout the paper $\Gamma $ denotes either $\Sigma _{n+1}$ or $\Pi _{n+1}$ , and we always assume only that $n\geq 0$ .
Theories are understood as sets of sentences, thought of as the set of nonlogical axioms of the theory. $\mathrm {I}\Sigma _n$ is the theory obtained by adding induction for $\Sigma _n$ formulae to Robinson’s arithmetic $\mathrm {Q}$ , while $\mathrm {I}\Sigma _0 + \mathrm {exp}$ is $\mathrm {Q}$ plus $\Sigma _0$ induction plus an axiom stating that the exponentiation function is total. We assume that all theories denoted $\mathrm {T}$ , etc., are consistent, arithmetically definable, extensions of $\mathrm {I}\Sigma _0 + \mathrm {exp}$ .
$\mathrm {T}$ is $\Gamma $ sound iff for all $\Gamma $ sentences $\unicode{x3b3} $ , if $\mathrm {T} \vdash \unicode{x3b3} $ , then $\mathbb {N} \models \unicode{x3b3} $ . The converse implication is sometimes known as $\Gamma $ completeness: hence $\mathrm {T}$ is $\Gamma $ complete iff for all $\Gamma $ sentences $\unicode{x3b3} $ , if $\mathbb {N} \models \unicode{x3b3} $ , then $\mathrm {T} \vdash \unicode{x3b3} $ . $\mathrm {S}$ is $\Gamma $ conservative over $\mathrm {T}$ iff for all $\Gamma $ sentences $\unicode{x3b3} $ , if $\mathrm {S} \vdash \unicode{x3b3} $ , then $\mathrm {T} \vdash \unicode{x3b3} $ .
We rely on a coding of finite sets and sequences in $\mathrm {I}\Sigma _0 + \mathrm {exp}$ , as developed by Hájek & Pudlák [Reference Hájek and Pudlák17, chap. I.1]. The set $\Sigma _0(X)$ is obtained by adding atomic formulae of the form $t \in X$ (where t is any term) and closing under propositional connectives and bounded quantifiers. The set $\Sigma _1(X)$ is obtained from $\Sigma _0(X)$ in the usual manner.
Let $\varepsilon $ be Ackermann’s membership relation: $n\varepsilon a$ expresses “the nth bit of the binary expansion of a is $1$ .” In other words, a can be regarded as a code for the set consisting of all n such that $n\varepsilon a$ . Then a is a zpiece of $\phi (x)$ if $\forall n < z (n\varepsilon a \leftrightarrow \phi (n))$ .
If $\phi (x)$ is any formula, $\ulcorner \phi (x) \urcorner $ denotes the numeral for the Gödel number of $\phi (x)$ under some fixed Gödel numbering, but we make no typographical distinction between natural numbers and the corresponding numerals. We use Feferman’s dot notation $\ulcorner \phi (\dot {x})\urcorner $ to represent the Gödel number of the sentence obtained by replacing the variable x with the actual value of x; hence x is free in $\ulcorner \phi (\dot {x})\urcorner $ . The notation $:=$ is used to express equality between formulae. Let $\top := 0 = 0$ and $\bot := \lnot \top $ . Let $\phi ^0 := \lnot \phi $ and $\phi ^1 := \phi $ . Footnote ^{1}
A relation X is numerated in $\mathrm {T}$ by a formula $\phi $ iff $X = \{\langle k_1,\dots ,k_n \rangle \in \omega ^n : \mathrm {T} \vdash \phi (k_1,\dots ,k_n)\}$ , and binumerated by $\phi $ in $\mathrm {T}$ if $\lnot \phi $ also numerates the complement of X. A relation X is correctly numerated by $\phi $ if $\phi $ numerates X and for all $k_1,\dots ,k_n$ , $\mathrm {T} \vdash \phi (k_1,\dots ,k_n)$ iff $\phi (k_1,\dots ,k_n)$ is true. A function f is strongly representable in $\mathrm {T}$ iff there is a formula $\phi (x_1,\dots ,x_n,y)$ that numerates $f(x_1,\dots ,x_n) = y$ in $\mathrm {T}$ , and moreover, if $f(k_1,\dots ,k_n) = m$ , then $\mathrm {T} \vdash \forall y (\phi (k_1,\dots ,k_n,y) \rightarrow y = m)$ .
Given a formula $\tau (z)$ , let $\mathrm {Prf}_\tau (x,y)$ be a formula expressing “y is a proof of the formula x from the set of sentences satisfying $\tau (z)$ .” Let $\mathrm {Pr}_\tau (x)$ be the formula $\exists y \mathrm {Prf}_\tau (x,y)$ , and let $\mathrm {Con}_\tau $ be the sentence $\lnot \mathrm {Pr}_\tau (\ulcorner \bot \urcorner )$ . Whenever $\tau (z)$ is $\Sigma _{n+1}$ , $\mathrm {Pr}_\tau (x)$ is equivalent to a $\Sigma _{n+1}$ formula in the real world. For any formula $\tau (x)$ , the notation $(\tau + z)(x)$ is used as shorthand for $\tau (x) \lor x = z$ . This convention is used in expressions such as $\mathrm {Prf}_{\tau + z}(x)$ .
Models of arithmetic are denoted $\mathcal {M}$ , etc., while the respective domains are denoted M, etc. The standard model is denoted $\mathbb {N}$ and its domain is $\omega $ . If $\mathcal {M}$ is nonstandard, then the standard system of $\mathcal {M}$ , $\mathrm {SSy}(\mathcal {M})$ , is the collection of sets $X \subseteq \omega $ such that for some $a \in M$ , $X = \{ n \in \omega : \mathcal {M} \models n\varepsilon a\}$ . Then X is coded in $\mathcal {M}$ , and a is a code for X.
A relation $X \subseteq M^n$ is $\Gamma $ definable in $\mathcal {M}$ (with parameters) iff there is a tuple $\overline {b}\in M$ and a formula $\phi (x_1,\dots ,x_n, \overline {y}) \in \Gamma $ such that $X = \{\langle m_1,\dots ,m_n \rangle \in M^n : \mathcal {M} \models \phi (m_1,\dots ,m_n,\overline {b})\}$ . Whenever this terminology is used without specifying a model $\mathcal {M}$ , it is assumed that $\mathcal {M} = \mathbb {N}$ . Thus, in particular, a $\Gamma $ definition of a theory $\mathrm {T}$ is a $\Gamma $ formula $\tau (x)$ such that $\mathrm {T} = \{ \phi : \mathbb {N} \models \tau (\ulcorner \phi \urcorner ) \}$ .
For each $\Gamma $ , $\mathrm {Th}_\Gamma (\mathcal {M})$ is the set of $\Gamma $ sentences true in $\mathcal {M}$ , that is, the set $\{ \phi \in \Gamma : \mathcal {M} \models \phi \}$ . If $\mathcal {M}$ is a submodel of $\mathcal {N}$ , and for all $\overline {a} \in M$ and $\unicode{x3b3} (\overline {x}) \in \Gamma $ , $\mathcal {M} \models \unicode{x3b3} (\overline {a})$ iff $\mathcal {N} \models \unicode{x3b3} (\overline {a})$ , then $\mathcal {N}$ is a $\Gamma $ elementary extension of $\mathcal {M}$ . If $\mathcal {M} \models \sigma $ for some $\Sigma _{n+1}$ sentence $\sigma $ , and $\mathcal {N}$ is a $\Sigma _n$ elementary extension of $\mathcal {M}$ , then $\mathcal {N} \models \sigma $ . $\mathcal {N}$ is an endextension of $\mathcal {M}$ (or, equivalently, $\mathcal {M}$ is an initial segment of $\mathcal {N}$ ) iff $\mathcal {M}$ is a submodel of $\mathcal {N}$ , and whenever $a \in M$ and $b \in N$ , and $\mathcal {N}\models b < a$ , then $b \in M$ .
Let $\emptyset ^{(n)}$ denote the nth Turing jump of the empty set (see, e.g., [Reference Rogers39, p. 254]). For each n, let $\langle \varphi _i^n : i \in \omega \rangle $ be an acceptable (in the sense of Rogers [Reference Rogers39, exercise 2.10]) enumeration of the functions that are recursively enumerable (r.e.) in $\emptyset ^{(n)}$ ; these are the partial nrecursive functions. For each partial nrecursive function $\varphi _e^n$ , let the eth nr.e. set $W_e^n$ be the domain of $\varphi _e^n$ . If f is a function such that $f \simeq \varphi _e^n$ for some e, then e is an nindex for f.
3 Preliminary principles
This section presents a number of suitably formulated principles that are useful in proving hierarchical incompleteness results of the kind given in Theorem 1.1. The basic versions of these principles can be found scattered across the literature, and none of them should be too surprising to the reader familiar with, e.g., Hájek and Pudlák [Reference Hájek and Pudlák17], Kaye [Reference Kaye22], Lindström [Reference Lindström29], and Smoryński [Reference Smoryński45].
The essence of the generalizations presented in this paper is that r.e. theories are replaced by $\Sigma _{n+1}$ definable ones, and that the base theory is pushed down as far as it will go below $\mathrm {PA}$ . On some occasions the theories have to satisfy additional constraints such as $\Sigma _n$ soundness or $\Pi _n$ completeness for the generalization to go through, and whenever this is the case that will be pointed out explicitly.
3.1 Basics, representability, recursion theory
Many textbooks in metamathematics rely on some version of the fact that Robinson’s arithmetic $\mathrm {Q}$ is $\Sigma _1$ complete: it proves all true $\Sigma _1$ sentences. This has the consequence that every r.e. set can be numerated in $\mathrm {Q}$ by a $\Sigma _1$ formula, which in turn allows for representing the theorem set of $\mathrm {Q}$ in $\mathrm {Q}$ and proving the first incompleteness theorem. Many proofs of these facts rely on $\Delta _0$ being closed under bounded quantification, and $\mathrm {Q}$ deciding all $\Delta _0$ sentences.
Since the aim of this paper is to generalize incompleteness results to $\Sigma _{n+1}$ definable theories rather than r.e. ones, there is a need for establishing a similar correspondence between $\Sigma _{n+1}$ definable sets and theories sufficient to represent them. On these higher levels, the roles of $\Delta _0$ and $\mathrm {Q}$ are played by the classes $\Sigma _0(\Sigma _{n})$ and the theories $\mathrm {I}\Sigma _n + \mathrm {Th}_{\Pi _n}(\mathbb {N})$ , respectively. Establishing this relationship is the goal of this subsection.
The following four observations (see, e.g., [Reference Smoryński43, lemma 0.3], [Reference Hájek16, lemma 2.2], [Reference Beklemishev1, lemma 2.9], [Reference Kikuchi and Kurahashi23, proposition 3.7]) serve as the starting point for the analogy between $\mathrm {Q}$ and $\mathrm {I}\Sigma _n + \mathrm {Th}_{\Pi _n}(\mathbb {N})$ .
Fact 3.2 (Basic properties of soundness and completeness).

1. $\mathrm {T}$ is consistent iff $\mathrm {T}$ is $\Sigma _0$ sound.

2. $\mathrm {T}$ is $\Pi _n$ complete iff $\mathrm {T}$ is $\Sigma _{n+1}$ complete.

3. $\mathrm {T}$ is $\Sigma _n$ sound iff $\mathrm {T}$ is $\Pi _{n+1}$ sound iff $\mathrm {T} + \mathrm {Th}_{\Sigma _{n+1}}(\mathbb {N})$ is consistent.

4. If $\mathrm {T}$ is consistent and $\Pi _n$ complete, then $\mathrm {T}$ is $\Sigma _n$ sound.
While the usual formulation of Gödel’s theorem pertains to r.e., consistent theories, the hierarchically formulated Theorem 1.1 is stated for $\Sigma _{n+1}$ definable, $\Sigma _n$ sound theories. In light of the preceding fact, consistency and $\Sigma _0$ soundness are equivalent, so the ordinary statement fits nicely into the hierarchical statement of the theorem. However, inspection of the published proofs of Theorem 1.1 reveals that $\Pi _n$ complete theories enter the argument in an indispensable way. In the proof by Kikuchi & Kurahashi [Reference Kikuchi and Kurahashi23], $\Pi _n$ completeness of $\mathrm {T}$ can be explicitly assumed, since in the case where $\mathrm {T}$ is not $\Pi _n$ complete, it fails to prove all true $\Pi _n$ sentences and can hardly prove all true $\Pi _{n+1}$ sentences. By contrast, the proof by Salehi & Seraji [Reference Salehi and Seraji40] bypasses assuming $\Pi _n$ completeness of $\mathrm {T}$ by instead constructing a $\Pi _{n+1}$ sentence that is independent of the $\Pi _n$ complete $\mathrm {T} + \mathrm {Th}_{\Pi _n}(\mathbb {N})$ , a theory whose consistency is guaranteed by the $\Sigma _n$ soundness of $\mathrm {T}$ . That sentence is, a fortiori, also independent of $\mathrm {T}$ .
The most conservative generalization of “r.e., consistent” is therefore “ $\Sigma _{n+1}$ definable, $\Pi _n$ complete, and consistent” rather than “ $\Sigma _{n+1}$ definable, $\Sigma _n$ sound.” As is clear from Theorem 1.1, the assumption of $\Pi _n$ completeness of $\mathrm {T}$ is sometimes excessively strong, and mere $\Sigma _n$ soundness is indeed enough for some further applications as well. In those cases, the proofs rely on the consistency of $\mathrm {T} + \mathrm {Th}_{\Pi _n}(\mathbb {N})$ , as in the proof by Salehi & Seraji [Reference Salehi and Seraji40]. In other cases, however, the $\Pi _n$ completeness is indispensable for the generalization to go through.Footnote ^{2}
The analogy with regard to soundness and completeness therefore goes as follows. Since $\mathrm {Q}$ is $\Pi _0$ complete, it is also $\Sigma _{1}$ complete, and since it is also consistent it follows that $\mathrm {Q}$ is $\Sigma _0$ sound and therefore also $\Pi _1$ sound. Now consider $\mathrm {Th}_{\Pi _n}(\mathbb {N})$ : This theory is $\Pi _n$ complete and therefore also $\Sigma _{n+1}$ complete; it is consistent and therefore $\Pi _{n+1}$ sound.
The role of $\mathrm {I}\Sigma _n$ in the analogy between $\mathrm {Q}$ and $\mathrm {I}\Sigma _n + \mathrm {Th}_{\Pi _n}(\mathbb {N})$ becomes clear through the next fact. Its proof will take up most of the remainder of this subsection.
Fact 3.3.

1. Every $\Sigma _n$  (or $\Pi _n$ ) definable relation on $\omega $ is binumerated by a $\Sigma _n$ (or $\Pi _n$ ) formula in $\mathrm {Q} + \mathrm {Th}_{\Pi _n}(\mathbb {N})$ .

2. Every $\Sigma _{n+1}$ definable relation on $\omega $ is numerated by a $\Sigma _{n+1}$ formula in $\mathrm {I}\Sigma _n + \mathrm {Th}_{\Pi _n}(\mathbb {N})$ .

3. Every function from $\omega ^k$ to $\omega $ that is recursive in $\emptyset ^{(n)}$ is strongly representable by a $\Sigma _{n+1}$ formula (with particularly nice properties) in $\mathrm {I}\Sigma _{n} + \mathrm {exp} + \mathrm {Th}_{\Pi _n}(\mathbb {N})$ .Footnote ^{3}
The first item is immediately seen to be true, since $\mathrm {Q} + \mathrm {Th}_{\Pi _n}(\mathbb {N})$ is consistent, $\Sigma _{n+1}$ complete, and $\Pi _{n+1}$ sound. The second and third items are elaborated on below, but first we need a few more stepping stones to help out in the constructions.
Fact 3.4 (Parametric diagonal lemma).

1. For every $\Gamma $ formula $\unicode{x3b3} (x,y)$ , we can effectively find a $\Gamma $ formula $\xi (x)$ such that
$$ \begin{align*} \mathrm{Q} \vdash \forall x (\xi(x) \leftrightarrow \unicode{x3b3}(x,\ulcorner \xi\urcorner))\text{.} \end{align*} $$ 
2. For every $\Gamma $ formula $\unicode{x3b3} (x,y)$ , we can effectively find a $\Gamma $ formula $\xi (x)$ such that, for each k,
$$ \begin{align*} \mathrm{Q} \vdash \xi(k) \leftrightarrow \unicode{x3b3}(k,\ulcorner \xi(k)\urcorner))\text{.} \end{align*} $$
Bibliographical remark. Item 1. of the above is essentially due to Montague [Reference Montague33, lemma 1]. The proof by Ehrenfeucht and Feferman [Reference Ehrenfeucht and Feferman10, lemma 1] of 2. actually suffices to prove 1.; see also [Reference Smoryński44] for a discussion of the development of the diagonal lemma.
Fact 3.5 (Generalized Craig’s trick).
For any $\Sigma _{n+1}$ definable theory $\mathrm {T}$ , defined by a $\Sigma _{n+1}$ formula $\sigma (z)$ , there is a deductively equivalent theory $\mathrm {S}$ , defined by a formula $\pi (x)$ that is $\Pi _n$ in $\mathrm {I}\Sigma _n$ . Moreover, $\mathrm {I}\Sigma _{n+1} \vdash \forall x (\mathrm {Pr}_\sigma (x) \leftrightarrow \mathrm {Pr}_\pi (x))$ .Footnote ^{4}
Bibliographical remark. Craig’s [Reference Craig7] formulation pertains to r.e. theories, for which there exist deductively equivalent theories with primitive recursive definitions. An early hierarchical generalization is due to Grzegorczyk et al. [Reference Grzegorczyk, Mostowski and RyllNardzewski14, theorem 2.2.C]. The hierarchical formulation presented here follows by inspection of a proof by Kurahashi [Reference Kurahashi27, proposition 9].
Convention. In light of Craig’s trick, we may assume that any $\Sigma _{n+1}$ definable theory is in fact $\Pi _n$ defined. In what follows, we write $\mathrm {Prf}_{\mathrm {T}}(x,y)$ to denote (ambiguously) any formula $\mathrm {Prf}_\tau (x,y)$ where $\tau $ is a $\Pi _n$ binumeration of $\mathrm {T}$ in $\mathrm {I}\Sigma _n + \mathrm {Th}_{\Pi _n}(\mathbb {N})$ , and moreover, this formula can be assumed to be $\Pi _n$ . Consequently, $\Pr _{\mathrm {T}}(x)$ is $\Sigma _{n+1}$ and $\mathrm {Con}_{\mathrm {T}}$ is $\Pi _{n+1}$ in $\mathrm {I}\Sigma _n$ .
Fact 3.6 [Reference Hájek and Pudlák17, lemmata I.2.9 and I.2.14 and theorem I.2.25].

1. In $\mathrm {I}\Sigma _n$ , both $\Sigma _n$ and $\Pi _n$ are closed under bounded quantifiers.Footnote ^{5}

2. $\mathrm {I}\Sigma _n \vdash \mathrm {I}\Sigma _0(\Sigma _n)$ .

3. Each $\Sigma _0(\Sigma _n)$ formula is $\Delta _{n+1}$ in $\mathrm {I}\Sigma _n$ .
All the pieces are now in place to prove a, sometimes useful, lemma from which Fact 3.3(2) follows immediately. The proof highlights the steps where induction and the additional truth from the standard model is required. For the statement of the lemma, recall that a relation X is correctly numerated by $\phi $ in $\mathrm {T}$ if $\phi $ numerates X in $\mathrm {T}$ , and for all $k_1,\dots ,k_n$ , $\mathrm {T} \vdash \phi (k_1,\dots ,k_n)$ iff $\phi (k_1,\dots ,k_n)$ is true.
Lemma 3.7. Let $\mathrm {T}$ be any $\Sigma _{n+1}$ definable, $\Pi _n$ complete, and consistent extension of $\mathrm {I}\Sigma _n$ and let $R(x_1,\dots ,x_m)$ be any $\Sigma _{n+1}$ definable relation. There is a $\Sigma _{n+1}$ formula $\phi (x_1,\dots ,x_m)$ that correctly numerates R in $\mathrm {T}$ .
Proof. Let $\rho (x_1,\dots ,x_m)$ define R. We may assume that $\rho (x_1,\dots ,x_m)$ is of the form $\exists z \pi (x_1,\dots , x_m,z)$ with $\pi \in \Pi _n$ . Let $\phi (x_1,\dots ,x_m)$ be such that, for all $k_1,\dots ,k_m$ , $\mathrm {I}\Sigma _n + \mathrm {Th}_{\Pi _n}(\mathbb {N})$ proves
Recall that if $\mathrm {T}$ is $\Sigma _{n+1}$ definable, then there is a deductively equivalent $\Pi _n$ definition of $\mathrm {T}$ , and $\mathrm {Prf}_{\mathrm {T}}(x,y)$ is therefore equivalent to a $\Pi _n$ formula in $\mathrm {I}\Sigma _n$ . Then
is a $\Sigma _0(\Sigma _n)$ formula, and is therefore, by Fact 3.6, equivalent to a $\Delta _{n+1}$ formula in $\mathrm {I}\Sigma _n$ . It follows that $\phi $ is equivalent to a $\Sigma _{n+1}$ formula in $\mathrm {I}\Sigma _n$ .
Suppose $R(k_1,\dots ,k_m)$ . Then $\mathbb {N} \models \rho (k_1,\dots ,k_m)$ , so there is then an i such that $\mathbb {N} \models \pi (k_1,\dots ,k_m,i)$ . Since $\pi $ is $\Pi _n$ and $\mathrm {Th}_{\Pi _n}(\mathbb {N})$ is $\Pi _n$ complete, it follows that $\mathrm {I}\Sigma _n + \mathrm {Th}_{\Pi _n}(\mathbb {N}) \vdash \pi (k_1,\dots ,k_m,i)$ . Suppose, for a contradiction, that $\mathrm {T} \nvdash \phi (k_1,\dots ,k_m)$ . By Fact 3.3(1),
for all p. It follows that
so $\mathrm {I}\Sigma _n + \mathrm {Th}_{\Pi _n}(\mathbb {N}) \vdash \phi (k_1,\dots ,k_m)$ , and $\mathrm {T} \vdash \phi (k_1,\dots ,k_m)$ .
Conversely, suppose $\mathrm {T} \vdash \phi (k_1,\dots ,k_m)$ , and let p be a proof of $\phi (k_1,\dots ,k_m)$ in $\mathrm {T}$ . Then $\mathrm {I}\Sigma _n + \mathrm {Th}_{\Pi _n}(\mathbb {N}) \vdash \mathrm {Prf}_{\mathrm {T}}(\ulcorner \phi (k_1,\dots ,k_m)\urcorner , p)$ . It follows that
Suppose, for a contradiction, that $\lnot R(k_1,\dots ,k_m)$ . Then for all i,
It follows that $\mathrm {I}\Sigma _n + \mathrm {Th}_{\Pi _n}(\mathbb {N}) \vdash \lnot \exists z < p \pi (k_1,\dots ,k_m,z)$ . We get
whence $\mathrm {I}\Sigma _n + \mathrm {Th}_{\Pi _n}(\mathbb {N}) \vdash \lnot \phi (k_1,\dots ,k_m)$ , and $\mathrm {T} \vdash \lnot \phi (k_1,\dots ,k_m)$ .
It remains to show that $\mathrm {T} \vdash \phi (k_1,\dots ,k_m)$ iff $\phi (k_1,\dots ,k_m)$ is true. The implication from right to left is trivial, since $\phi $ is $\Sigma _{n+1}$ in $\mathrm {I}\Sigma _n$ and $\mathrm {Th}_{\Pi _n}(\mathbb {N})$ is $\Sigma _{n+1}$ complete. For the other direction, suppose $\mathrm {T} \vdash \phi (k_1,\dots ,k_m)$ , and let p be the least such proof. Then
Suppose further that there is no $i < p$ such that $\pi (k_1,\dots ,k_m,i)$ . Then, as before, $\mathrm {T} \vdash \lnot \phi (k_1,\dots ,k_m)$ , a contradiction. Thus there is an $i < p$ such that $\pi (k_1,\dots ,k_m,i)$ is true. Since p is minimal, $\forall y \leq i \lnot \mathrm {Prf}_{\mathrm {T}}(\ulcorner \phi (k_1,\dots ,k_m)\urcorner ,y)$ , so
is true, and therefore $\phi (k_1,\dots ,k_m)$ is true, as desired.
Bibliographical remark. The correct representability of $\Sigma _1$ relations in $\mathrm {Q}$ is due to Ehrenfeucht and Feferman [Reference Ehrenfeucht and Feferman10]. The proof above mimics Lindström's [Reference Lindström29] version of Shepherdson's [Reference Shepherdson42] proof of the same result.
Fact 3.3(2) follows directly from Lemma 3.7, and it only remains to give an argument for Fact 3.3(3). For this we need two more facts, the first being a version of Post’s theorem.
Fact 3.8 [Reference Post36].
A relation is $\Sigma _{n+1}$ iff it is r.e. in $\emptyset ^{(n)}$ .
Fact 3.9 (The selection theorem).
For each $\Sigma _{n+1}$ formula $\phi $ with exactly the variables $x_1,\dots ,x_k$ free, there is a $\Sigma _{n+1}$ formula $\mathrm {Sel}\{\phi \}$ with exactly the same free variables, such that:

1. $\mathrm {I}\Sigma _n \vdash \forall x_1,\dots ,x_k(\mathrm {Sel}\{\phi \}(x_1,\dots ,x_k) \rightarrow \phi (x_1,\dots ,x_k))$ ;

2. $\mathrm {I}\Sigma _n \vdash \forall x_1,\dots ,x_k,z(\mathrm {Sel}\{\phi \}(x_1,\dots ,x_k) \land \mathrm {Sel}\{\phi \}(x_1,\dots ,x_{k1},z) \rightarrow x_k = z)$ ;

3. $\mathrm {I}\Sigma _n \vdash \forall x_1,\dots ,x_{k1} (\exists x_k \phi (x_1,\dots ,x_k) \rightarrow \exists x_k \mathrm {Sel}\{\phi \}(x_1,\dots ,x_k))$ .
Proof sketch. We may assume that any given $\Sigma _{n+1}$ formula $\phi (x_1,\dots ,x_k)$ is on the form $\exists w \pi (x_1,\dots ,x_k,w)$ with $\pi \in \Pi _n$ . Let $(w)_i$ denote the ith element of the ordered pair coded by w, and define $\mathrm {Sel}\{\phi \}(x_1,\dots ,x_k)$ to be the formula
By Fact 3.6, this formula is equivalent in $\mathrm {I}\Sigma _n$ to a $\Sigma _{n+1}$ formula. Using $\Sigma _n$ induction, it is easy to check that it has the three desired properties.
Bibliographical remark. Smoryński [Reference Smoryński45, theorem 0.6.9] provides a proof of the selection theorem for $n=0$ , and the generalization is straightforward. The numeration below of partial recursive functions is also based on the treatment in Section 0 of his book.
Fact 3.3(3) can now be established as follows: Let f be a kary partial nrecursive function; then the relation $f(x_1,\dots ,x_k) = y$ is $\Sigma _{n+1}$ by Fact 3.8. By Fact 3.3(2), this relation is correctly numerated in $\mathrm {I}\Sigma _n + \mathrm {Th}_{\Pi _n}(\mathbb {N})$ by some $\Sigma _{n+1}$ formula $\psi (x_1,\dots ,x_k,y)$ . Finally, by Fact 3.9, f is strongly represented in $\mathrm {I}\Sigma _n + \mathrm {exp} + \mathrm {Th}_{\Pi _n}(\mathbb {N})$ by the $\Sigma _{n+1}$ formula $\mathrm {Sel}\{\mathrm {Sat}_{\Sigma _{n+1}}\}(\ulcorner \psi \urcorner , x_1,\dots ,x_k, y)$ . This concludes the proof of Fact 3.3.
Convention. The partial nrecursive function with index e, $\varphi _e^n$ , can now be defined to be the function whose graph is defined by $\mathrm {Sel}\{\mathrm {Sat}_{\Sigma _{n+1}}\}(e, y_1, \dots , y_k, z)$ in $\mathbb {N}$ . The resulting enumeration is acceptable in the sense of Rogers [Reference Rogers39]. Whenever convenient, $\varphi _e^n(m_1,\dots ,m_i) = k$ is used as a shorthand for $\mathrm {Sel}\{\mathrm {Sat}_{\Sigma _{n+1}}\}(e, m_1,\dots , m_i, k)$ .
To wrap up this subsection, we sketch a proof of a formalized version of the second recursion theorem.
Fact 3.10 (Formalized second recursion theorem).
Let $f : \omega ^2 \to \omega $ be nrecursive. There is an $e \in \omega $ such that
Proof. Let, by Fact 3.3(3), $\psi (x,y,z)$ be a $\Sigma _{n+1}$ formula strongly representing f in $\mathrm {I}\Sigma _n + \mathrm {exp} + \mathrm {Th}_{\Pi _n}(\mathbb {N})$ . Let, by Fact 3.4, $\unicode{x3b3} (y,z)$ be a formula such that
Then $e= \ulcorner \unicode{x3b3} \urcorner $ is as desired.
The recursion theorem is usually deployed in the following manner. Define an nrecursive function $f(z,x)$ in stages, using z as a parameter; the resulting function may differ depending on the choice of z. By the recursion theorem, there is then an nindex e such that $\varphi _e^n(x)$ coincides with $f(e,x)$ . This legitimates selfreferential constructions where an index of f is being used in the construction of f itself.
Bibliographical remark. The recursion theorem is due to Kleene [Reference Kleene24, theorem XXVII]. Smoryński [Reference Smoryński45, theorem 0.6.12] shows how it can be formalized in (essentially) $\mathrm {I}\Sigma _0 + \mathrm {exp}$ for ( $0$ )recursive functions.
3.2 Strong provability predicates
A central piece in the proof of Gödel’s incompleteness theorem for r.e. theories $\mathrm {T}$ is the use of formal provability predicates $\mathrm {Pr}_{\mathrm {T}}(x)$ , expressing “x is provable in $\mathrm {T}$ .” In the current setting, with $\Sigma _{n+1}$ definable theories in focus, the corresponding strong provability predicates $\Pr _{\mathrm {T},\Sigma _{n+1}}(x)$ express “x is provable in $\mathrm {T}$ from true $\Sigma _{n+1}$ sentences.”Footnote ^{6} To define these predicates, we first need to introduce partial satisfaction predicates.
Fact 3.11 (Partial satisfaction predicates).
For each k and $\Gamma $ , there is a $k+1$ ary $\Gamma $ formula $\mathrm {Sat}_{\Gamma }(x,x_1,\dots ,x_k)$ such that for every $\Gamma $ formula $\phi (x_1,\dots ,x_k)$ ,
Hence there is also a $\Gamma $ formula $\mathrm {Tr}_\Gamma (x)$ such that for every $\Gamma $ sentence $\phi $ ,
Bibliographical remark. Modern proofs of this fact are due to Hájek and Pudlák [Reference Hájek and Pudlák17] and Kaye [Reference Kaye22]. The use of partial satisfaction predicates, however, goes back to Hilbert and Bernays [Reference Hilbert and Bernays19].
Definition 3.12. Let, for each $\Gamma $ , $\mathrm {Prf}_{\mathrm {T},\Gamma }(x,y)$ be the formula
Let $\mathrm {Pr}_{\mathrm {T},\Gamma }(x) := \exists y \mathrm {Prf}_{\mathrm {T},\Gamma }(x,y)$ , and let $\mathrm {Con}_{\mathrm {T},\Gamma } := \lnot \mathrm {Pr}_{\mathrm {T},\Gamma }(\ulcorner \bot \urcorner )$ .
We are mainly interested in the predicates $\mathrm {Pr}_{\mathrm {T},\Sigma _{n+1}}(x)$ . These provability predicates have many similarities with the usual provability predicate. Firstly, if $\mathrm {T}$ is $\Sigma _{n+1}$ definable, then $\mathrm {Pr}_{\mathrm {T},\Sigma _{n+1}}(x)$ is $\Sigma _{n+1}$ , and $\mathrm {Con}_{\mathrm {T},\Sigma _{n+1}}$ consequently $\Pi _{n+1}$ . Secondly, they satisfy provable $\Sigma _{n+1}$ completeness and Löb’s derivability conditions. These notions also have their roots with Hilbert and Bernays [Reference Hilbert and Bernays19]; see also [Reference Feferman11, theorem 5.4 and corollary 5.5]. The versions presented here are extracted from [Reference Beklemishev1, propositions 2.10 and 2.11] and [Reference Smoryński45, lemma 3.3.7].
Fact 3.13 (Provable $\Sigma _{m+1}$ completeness).
Let $\mathrm {T}$ be a $\Sigma _{n+1}$ definable theory, and let $\sigma (x_1,\dots ,x_k)$ be any $\Sigma _{m+1}$ formula. Then
Fact 3.14 (Löb conditions).
If $\mathrm {T}$ is a $\Sigma _{n+1}$ definable extension of $\mathrm {I}\Sigma _0 + \mathrm {exp}$ , then, for each $m\geq 0$ , and for all sentences $\phi $ , $\psi $ ,

L1. if $\mathrm {T}\vdash \phi $ , then $\mathrm {I}\Sigma _n + \exp + \mathrm {Th}_{\Pi _n}(\mathbb {N}) \vdash \mathrm {Pr}_{\mathrm {T},\Sigma _{m+1}}(\ulcorner \phi \urcorner )$ ;

L2. $\mathrm {I}\Sigma _0 + \mathrm {exp} \vdash \mathrm {Pr}_{\mathrm {T},\Sigma _{m+1}}(\ulcorner \phi \urcorner ) \land \mathrm {Pr}_{\mathrm {T},\Sigma _{m+1}}(\ulcorner \phi \rightarrow \psi \urcorner ) \rightarrow \mathrm {Pr}_{\mathrm {T},\Sigma _{m+1}}(\ulcorner \psi \urcorner )$ ;

L3. $\mathrm {I}\Sigma _0 + \mathrm {exp} \vdash \mathrm {Pr}_{\mathrm {T},\Sigma _{m+1}}(\ulcorner \phi \urcorner ) \rightarrow \mathrm {Pr}_{\mathrm {T},\Sigma _{m+1}}(\ulcorner \mathrm {Pr}_{\mathrm {T},\Sigma _{m+1}}(\ulcorner \phi \urcorner )\urcorner )$ .
Similar statements also hold for formulae:

L1’. if $\mathrm {T}\vdash \forall x \phi (x)$ , then $\mathrm {I}\Sigma _n + \exp + \mathrm {Th}_{\Pi _n}(\mathbb {N}) \vdash \forall x \mathrm {Pr}_{\mathrm {T},\Sigma _{m+1}}(\ulcorner \phi (\dot {x}) \urcorner )$ ;

L2’. $\mathrm {I}\Sigma _0 + \mathrm {exp} \vdash \forall x (\mathrm {Pr}_{\mathrm {T},\Sigma _{m+1}}(\ulcorner \phi (\dot {x}) \urcorner ) \land \mathrm {Pr}_{\mathrm {T},\Sigma _{m+1}}(\ulcorner \phi (\dot {x}) \rightarrow \psi (\dot {x})\urcorner ) \rightarrow \mathrm {Pr}_{\mathrm {T},\Sigma _{m+1}}(\ulcorner \psi (\dot {x}) \urcorner ))$ ;

L3’. $\mathrm {I}\Sigma _0 + \mathrm {exp} \vdash \forall x (\mathrm {Pr}_{\mathrm {T},\Sigma _{m+1}}(\ulcorner \phi (\dot {x}) \urcorner ) \rightarrow \mathrm {Pr}_{\mathrm {T},\Sigma _{m+1}}(\ulcorner \mathrm {Pr}_{\mathrm {T},\Sigma _{m+1}}(\ulcorner \phi (\dot {x}) \urcorner )\urcorner ))$ .
The stronger background theory used in items L1. and L1’. is enough to ensure the numerability of the $\Sigma _{n+1}$ definable theory $\mathrm {T}$ . For r.e. theories $\mathrm {T}$ , $\mathrm {I}\Sigma _0 + \mathrm {exp}$ suffices.
We now turn our attention to the bounded provability predicates that feature prominently in the sequel. Consider again the $\Sigma _{n+1}$ formula $\mathrm {Pr}_{\mathrm {T},\Sigma _{n+1}}(x)$ for a $\Sigma _{n+1}$ definable $\mathrm {T}$ . We may assume that there is a $\Pi _n$ formula $\pi (x,y)$ such that
Let $\mathrm {Pr}_{\mathrm {T},\Sigma _{n+1}}^k(x)$ be the formula $\exists z \leq k \pi (x,z)$ .Footnote ^{7} Then, by Fact 3.6, this formula is $\Pi _n$ in $\mathrm {I}\Sigma _n$ , and therefore decidable in $\mathrm {I}\Sigma _n + \mathrm {exp} + \mathrm {Th}_{\Pi _n}(\mathbb {N})$ .Footnote ^{8} As a consequence, we have strong reflection properties for the bounded proof predicates.
Fact 3.15 (Uniform small reflection).
Let $\mathrm {T}$ be a $\Sigma _{n+1}$ definable, consistent extension of $\mathrm {I}\Sigma _0 + \mathrm {exp}$ . For each $\phi (x)$ and k, we have:
Bibliographical remark. A forerunner to this reflection principle is proved by Feferman [Reference Feferman12, lemma 2.18]. The generalization to $\Sigma _{n+1}$ definable theories is straightforward; see also [Reference Hájek and Pudlák17, lemma III.4.40] for some middle ground: reflection for proofs from true $\Sigma _{n+1}$ sentences for r.e. theories.
Fact 3.16 (Formalized small reflection).
Let $\mathrm {T}$ be a $\Sigma _{n+1}$ definable, consistent extension of $\mathrm {I}\Sigma _{n+1}$ . Then we have:
Bibliographical remark. Verbrugge & Visser [Reference Verbrugge and Visser46] show how the small reflection principle can be formalized in (theories weaker than) $\mathrm {I}\Sigma _0 + \mathrm {exp}$ . I am grateful to one of the referees for pointing out a crucial error in an earlier statement of this fact.
3.3 Model theory of arithmetic
The remainder of this section concerns the model theory of arithmetic, building up to a characterization of $\Pi _n$ conservativity in the spirit of Orey, Hájek, Guaspari, and Lindström. A first step toward that goal is the following miniaturization of the arithmetized completeness theorem in the style of McAloon [Reference McAloon31, theorems 1.7 and 2.2].
Fact 3.17 (The arithmetized completeness theorem).
Fix $m\leq n$ . If $\mathcal {M} \models \mathrm {I}\Sigma _{n+1}$ , and $\mathrm {T}$ is a theory that is $\Sigma _{n+1}$ definable in $\mathcal {M}$ such that $\mathcal {M} \models \mathrm {Con}_{\mathrm {T},\Pi _m}$ , then there is a $\Sigma _m$ elementary endextension of $\mathcal {M}$ satisfying $\mathrm {T}$ .
The proof of the arithmetized completeness theorem rests on the following version of the low basis theorem by Hájek & Pudlák [Reference Hájek and Pudlák17, corollary I.3.10(1)]:
Fact 3.18 (Low basis theorem).
Provably in $\mathrm {I}\Sigma _{n+1}$ , each dyadic unbounded $\Delta _{n+1}$ tree has an unbounded $LL_{n+1}$ branch.
Here, a tree is a set of finite binary sequences that is closed under taking initial segments. A branch through a tree is a subtree that is linearly ordered under the relation “being an initial segment of.” See [Reference Hájek and Pudlák17, chap. I.3(b)] for more details. A definition of the class $LL_{n+1}$ used in the statement of the low basis theorem can be found in [Reference Hájek and Pudlák17, chap. I.2(d)]. The only properties of $LL_{n+1}$ sets that are used in the proof of the arithmetized completeness theorem are that $\mathrm {I}\Sigma _{n+1}$ proves induction for $\Sigma _1(LL_{n+1})$ sets, and that every set recursive in an $LL_{n+1}$ set is itself $LL_{n+1}$ [Reference Hájek and Pudlák17, I.2.78–79)].
For the proof of the arithmetized completeness theorem, we also rely on $\mathrm {I}\Sigma _{n+1}$ being able to define formalized versions of syntactic and semantic notions such as “formula,” “term,” “theory,” “satisfaction,” and “model,” so that the relevant constructions can be carried out within $\mathrm {I}\Sigma _{n+1}$ itself. The reader is again referred to [Reference Hájek and Pudlák17], especially Chapter I.4, for a detailed development of these concepts. The generalization to $\Sigma _{n+1}$ definable theories is straightforward, and fits safely within $\mathrm {I}\Sigma _{n+1}$ .
Proof of the arithmetized completeness theorem.
Fix $m\leq n$ . Let $\mathcal {M} \models \mathrm {I}\Sigma _{n+1}$ and let $\mathrm {T}$ be a theory $\Sigma _{n+1}$ definable in $\mathcal {M}$ such that $\mathcal {M}\models \mathrm {Con}_{\mathrm {T},\Pi _{m}}$ . Reason in $\mathcal {M}$ :
Since $\mathrm {T}$ is $\Sigma _{n+1}$ and we have $\mathrm {I}\Sigma _{n+1}$ , we may assume $\mathrm {T}$ to be $\Pi _n$ defined and Henkinized. Let $\psi _0,\psi _1,\dots $ be an enumeration of all sentences. Define a dyadic tree T by
$s \in T$ iff there is no $p \leq s $ such that p is a proof of contradiction in $\mathrm {T}$ from the true $\Pi _{m}$ sentences plus $\{ \psi _i^{(s)_i} : i < l(s)\}$ .
The proof relation for $\mathrm {T} + \mathrm {Th}_{\Pi _{m}}(\mathcal {M})$ is $\Pi _{n}$ in $\mathcal {M}$ , so the tree T is at most $\Delta _{n+1}$ in $\mathcal {M}$ . Then $\mathrm {I}\Sigma _{n+1}$ suffices to show that T is unbounded, so by Fact 3.18 there is an unbounded $LL_{n+1}$ branch $B = \{b_0,b_1,\dots \}$ through T.
Let $\hat {\mathrm {T}} = \{ \psi _i : b_i = 1\}$ . Then $\hat {\mathrm {T}}$ is recursive in the $LL_{n+1}$ branch B, and is therefore $LL_{n+1}$ itself. A term model $\mathcal {K}$ satisfying $\mathrm {T} + \mathrm {Th}_{\Pi _{m}}(\mathcal {M})$ can then be read off $\hat {\mathrm {T}}$ in the usual way. Finally, note that $\mathcal {K}$ is recursive in $\hat {\mathrm {T}}$ and therefore $LL_{n+1}$ . Using induction for $\Sigma _1(LL_{n+1})$ (provided by $\mathrm {I}\Sigma _{n+1}$ ), we can now define an $LL_{n+1}$ embedding f of $\mathcal {M}$ onto an initial segment of $\mathcal {K}$ by letting $f(0) = 0^{\mathcal {K}}$ and $f(x+1) =$ the $\mathcal {K}$ successor of $f(x)$ .
The next few facts are used in the proof of the generalized Orey–Hájek characterization.
Fact 3.19 (Overspill).
Let $\mathcal {M} \models \mathrm {I}\Sigma _{n+1}$ . Suppose that $a \in M$ and that $\phi (x,y)$ is a $\Sigma _0(\Sigma _{n+1})$ formula such that $\mathcal {M} \models \phi (k,a)$ for all $k\in \omega $ . Then there is a $b \in M \setminus \omega $ such that $\mathcal {M} \models \forall x \leq b \phi (x,a)$ .
Bibliographical remark. The notion of overspill is originally due to Robinson [Reference Robinson38], while the hierarchical version stated here is from [Reference Hájek and Pudlák17, corollary IV.1.16].
Fact 3.20. If $\mathcal {M}$ is a nonstandard model of $\mathrm {I}\Sigma _{n+1}$ , and $\phi (x)$ is a $\Sigma _{n+1}$ formula which may include parameters from $\mathcal {M}$ , then $\{ k \in \omega : \mathcal {M} \models \phi (k)\}$ is coded in $\mathcal {M}$ .
It follows that if $\mathcal {M} \models \mathrm {I}\Sigma _{n+1}$ , then $\mathrm {Th}_{\Sigma _{n+1}}(\mathcal {M})$ is coded in $\mathcal {M}$ .
Fact 3.21 [Reference McAloon32], cf. [Reference D'Aquino8].
If $\mathcal {M}$ is a countable nonstandard model of $\mathrm {I}\Delta _0$ , and $\mathrm {T}$ is $\Sigma _1$ sound, then for every nonstandard $c \in M$ , there is a nonstandard initial segment of $\mathcal {M}$ below c that is a model of $\mathrm {T}$ .
Fact 3.22 (Refined Friedman embedding theorem).
If $\mathcal {M}$ and $\mathcal {N}$ are countable nonstandard models of $\mathrm {I}\Sigma _{n+1}$ then the following are equivalent:

1. $\mathcal {M}$ is embeddable as a $\Sigma _n$ elementary initial segment of $\mathcal {N}$ ;

2. $\mathrm {SSy}(\mathcal {M}) = \mathrm {SSy}(\mathcal {N})$ and $\mathrm {Th}_{\Sigma _{n+1}}(\mathcal {M}) \subseteq \mathrm {Th}_{\Sigma _{n+1}}(\mathcal {N})$ .
Bibliographical remark. This refinement of Friedman’s [Reference Friedman, Mathias and Rogers13] embedding theorem for $n=0$ is due to Ressayre [Reference Ressayre and Simpson37, theorem 1.I] and Dimitracopoulos and Paris [Reference Dimitracopoulos and Paris9, corollary 2.4], independently. The hierarchical generalization is straightforward, and has been worked out by Cornaros [Reference Cornaros6, corollary 15].
We are now ready to prove the final fact: an excerpt of a generalization of the Orey–Hájek–Guaspari–Lindström characterization of interpretability. For extensions of $\mathrm {PA}$ , the equivalence of 1. and 3. is due to Guaspari [Reference Guaspari15, theorem 6.5(1)]. The equivalence of 1. and 2. for finitely axiomatizable theories seems to have been known to experts for some time, while the equivalence of 2. and 3. for r.e. extensions of fragments of $\mathrm {PA}$ is stated without proof by Blanck and Enayat [Reference Blanck and Enayat4, theorem 2.11]. With the previous facts of this section in place, the generalization to $\Sigma _{n+1}$ definable theories presents no further difficulties.
Fact 3.23 (OHGL characterization).
Let $\mathrm {S}$ and $\mathrm {T}$ be $\Sigma _{n+1}$ definable, consistent extensions of $\mathrm {I}\Sigma _{n+1}$ , and suppose that $\mathrm {S}$ is also $\Pi _n$ complete. The following are equivalent:

1. $\mathrm {S}$ is $\Pi _{n+1}$ conservative over $\mathrm {T}$ ;

2. for all $k\in \omega $ , $\mathrm {T} \vdash \mathrm {Con}_{\mathrm {S},\Sigma _{n+1}}^k$ ;

3. every countable model $\mathcal {M}$ of $\mathrm {T}$ with $\mathrm {S} \in \mathrm {SSy}(\mathcal {M})$ has a $\Sigma _n$ elementary extension to a model of $\mathrm {S}$ .
Proof. 1. $\Rightarrow $ 2. Suppose that $\mathrm {S}$ is $\Pi _{n+1}$ conservative over $\mathrm {T}$ . By Fact 3.15 and $\Pi _n$ completeness of $\mathrm {S}$ , $\mathrm {S} \vdash \mathrm {Con}_{\mathrm {S},\Sigma _{n+1}}^k$ for all $k\in \omega $ . But $\mathrm {Con}_{\mathrm {S},\Sigma _{n+1}}^k$ is at most $\Pi _{n+1}$ , so $\mathrm {T} \vdash \mathrm {Con}_{\mathrm {S},\Sigma _{n+1}}^k$ for all $k \in \omega $ .
2. $\Rightarrow $ 3. Suppose $\mathrm {T} \vdash \mathrm {Con}_{\mathrm {S},\Sigma _{n+1}}^k$ for all $k \in \omega $ . Let $\mathcal {M}$ be a countable model of $\mathrm {T}$ and suppose that $\mathrm {S} \in \mathrm {SSy}(\mathcal {M})$ . Since $\mathrm {T}$ extends $\mathrm {I}\Sigma _{n+1}$ , it follows that $\mathrm {Con}_{\mathrm {S},\Sigma _{n+1}}^k$ is at most $\Pi _{n+1}$ , and we can use overspill to get $\mathcal {M} \models \mathrm {Con}_{\mathrm {S},\Sigma _{n+1}}^c$ for some nonstandard $c\in M$ . By Fact 3.21, there is a submodel $\mathcal {M}_0 \models \mathrm {PA}$ of $\mathcal {M}$ , all of whose elements are below c, and there is some nonstandard a below c that codes $\mathrm {Th}_{\Sigma _{n+1}}(\mathcal {M})$ . This ensures that $\mathcal {M}_0 \models \mathrm {Con}_{\mathrm {S} + \{m:m\varepsilon a\}}$ , so Fact 3.17 guarantees the existence of an endextension $\mathcal {K}$ of $\mathcal {M}_0$ , satisfying $\mathrm {S} + \{m:m\varepsilon a\}$ and therefore also $\mathrm {S} + \mathrm {Th}_{\Sigma _{n+1}}(\mathcal {M})$ .
At this point, the situation is that $\mathrm {SSy}(\mathcal {M}) = \mathrm {SSy}(\mathcal {M}_0) = \mathrm {SSy}(\mathcal {K})$ , $\mathcal {M}$ and $\mathcal {K}$ are countable, and $\mathrm {Th}_{\Sigma _{n+1}}(\mathcal {M}) \subseteq \mathrm {Th}_{\Sigma _{n+1}}(\mathcal {K})$ . Then Fact 3.22 ensures that $\mathcal {M}$ can be embedded as a $\Sigma _n$ elementary initial segment of $\mathcal {K}$ .
3. $\Rightarrow $ 1. Prove the contrapositive statement by assuming that $\mathrm {S}$ is not $\Pi _{n+1}$ conservative over $\mathrm {T}$ . Then there is a $\Pi _{n+1}$ sentence $\pi $ such that $\mathrm {S} \vdash \pi $ but $\mathrm {T}+ \lnot \pi $ is consistent. Let $\mathcal {M} \models \mathrm {T}+ \lnot \pi $ . If $\mathcal {K} \models \mathrm {S}$ were a $\Sigma _n$ elementary extension of $\mathcal {M}$ , then $\mathcal {K}$ would satisfy both $\pi $ and $\lnot \pi $ , a contradiction.
4 Applications
The goal of this section is to prove a handful of hierarchical incompleteness results, using the tools we reviewed in the previous one. The first such result stems from Mostowski [Reference Mostowski34, theorem 2], who proved that whenever $\{\mathrm {T}_i: i \in \omega \}$ is an r.e. family of consistent, r.e. theories extending $\mathrm {Q}$ , then there is a $\Pi _1$ formula that is simultaneously independent over these theories. Here, we understand the concept of an independent formula in the following way:
Definition 4.24. A formula $\xi (x)$ is independent over $\mathrm {T}$ if, for every $g : \omega \to \{0,1\}$ , the theory $\mathrm {T} + \{ \xi (k)^{g(k)}\}$ is consistent. Recall that $\xi (k)^0= \lnot \xi (k)$ and $\xi (k)^1 = \xi (k)$ .
While one of Mostowski’s accomplishments was the simultaneous independence over a whole r.e. family of theories, this aspect of his result is deliberately ignored here. Instead, we focus on how to construct formulae independent over $\Sigma _{n+1}$ definable theories.
Theorem 4.25. Let $\mathrm {T}$ be a $\Sigma _{n+1}$ definable, $\Sigma _n$ sound extension of $\mathrm {I}\Sigma _n + \mathrm {exp}$ . Then there is a $\Sigma _{n+1}$ formula $\xi (x)$ that is independent over $\mathrm {T}$ .
Proof. Define a function $f(x)$ by the stipulation that $f(m) = k$ iff there is a proof p of $\varphi ^n_m(m) \neq k$ in $\mathrm {T}$ , and for each $q<p$ and $k_0 \leq k$ , q is not a proof of $\varphi ^n_m(m) \neq k_0$ in $\mathrm {T}$ .
Since $\mathrm {T}$ is $\Sigma _{n+1}$ definable, there is a deductively equivalent $\Pi _n$ definition of $\mathrm {T}$ . Hence, the relation $f(x) = y$ is r.e. in $\emptyset ^{(n)}$ , and therefore partial nrecursive. Let e be an nindex for f, and let $\xi (x)$ be the formula
Since $\mathrm {T}$ extends $\mathrm {I}\Sigma _n$ , we may assume that both $\varphi ^n_x(y) = z$ and $\xi (x)$ are equivalent in $\mathrm {T}$ to $\Sigma _{n+1}$ formulae. The proof that $\xi (x)$ is as desired has two parts. The first part shows that $\mathrm {T} + \varphi ^n_e(e) = k$ is consistent for each $k\in \omega $ .
Suppose, for a contradiction, that $\mathrm {T} + \varphi ^n_e(e) = k$ is inconsistent for some $k\in \omega $ . We may assume that k is the least such number. Then $\mathrm {T} \vdash \varphi ^n_e(e) \neq k$ with some minimal proof p, so $f(e) = \varphi ^n_e(e) = k$ by definition. With $\mathrm {T}$ extending $\mathrm {I}\Sigma _n$ , we have $\mathrm {T} + \mathrm {Th}_{\Pi _{n}}(\mathbb {N}) \vdash \varphi ^n_e(e) = k$ by Fact 3.3(3). But then $\mathrm {T} + \mathrm {Th}_{\Pi _{n}}(\mathbb {N})$ is inconsistent, which by Fact 3.2 contradicts the assumption that $\mathrm {T}$ is $\Sigma _n$ sound. Hence the theory $\mathrm {T} + \varphi ^n_e(e) = k$ is consistent for any choice of $k \in \omega $ .
In this final part of the proof, we show that $\xi (x)$ is independent over $\mathrm {T}$ . Let g be any function from $\omega $ to $\{0,1\}$ and let $X = \{ \xi (k)^{g(k)} : k\in \omega \}$ . Let Y be any finite subset of X, and let Z be the set $\{k: \xi (k) \in Y\}$ . Let $\zeta (x) := x \varepsilon a$ , where a is a code for the finite set Z; then $\zeta $ binumerates Z in $\mathrm {Q}$ .
Reason in the consistent theory $\mathrm {T} + \varphi ^n_e(e) = \ulcorner \zeta \urcorner $ :
If $\xi (x)$ , then $\varphi ^n_e(e) = z \land \mathrm {Sat}_{\Sigma _{n+1}}(z,x)$ for some z. But z is unique and $\varphi ^n_e(e) = \ulcorner \zeta \urcorner $ , so $\mathrm {Sat}_{\Sigma _{n+1}}(\ulcorner \zeta \urcorner ,x)$ and therefore $\zeta (x)$ .
Conversely, observe that since $\varphi ^n_e(e) = \ulcorner \zeta \urcorner $ , $\xi (x)$ follows from $\zeta (x)$ by Fact 3.11 and $\exists $ introduction.
Hence the theory $\mathrm {T} + \forall x (\xi (x) \leftrightarrow \mathrm {Sat}_{\Sigma _{n+1}}(\ulcorner \zeta \urcorner ,x))$ is consistent. If $k \in Z$ , then $\mathrm {T} \vdash \mathrm {Sat}_{\Sigma _{n+1}}(\ulcorner \zeta \urcorner ,k)$ , so $\mathrm {T} + \forall x (\xi (x) \leftrightarrow \mathrm {Sat}_{\Sigma _{n+1}}(\ulcorner \zeta \urcorner ,x)) \vdash \xi (k)$ , and similarly for $k \notin Z$ . Hence the consistent theory $\mathrm {T} + \forall x (\xi (x) \leftrightarrow \mathrm {Sat}_{\Sigma _{n+1}}(\ulcorner \zeta \urcorner ,x))$ proves all the sentences in Y, so $\mathrm {T} + Y$ is consistent. By compactness, it follows that $\mathrm {T} + X$ is consistent, and therefore $\xi (x)$ is independent over $\mathrm {T}$ .
The Gödel–Rosser incompleteness Theorem 1.1 for arithmetically definable theories follows immediately from the result above. While the generalization to arithmetically definable theories is new, the basic idea of this proof is due to Kripke [Reference Kripke26, corollary 1.1], who used it to rederive Mostowski’s result from his own theorem on the existence of flexible formulae. Here, we understand flexibility in the following sense:
Definition 4.26. A formula $\unicode{x3b3} (x)$ is flexible for $\Gamma $ over $\mathrm {T}$ if, for every $\delta (x) \in \Gamma $ , the theory $\mathrm {T} + \forall x (\unicode{x3b3} (x) \leftrightarrow \delta (x))$ is consistent.
The definitions used by Kripke obscure the original content of his theorem, but, in hindsight, his proof yields that for every consistent, r.e. extension $\mathrm {T}$ of $\mathrm {I}\Sigma _0 + \mathrm {exp}$ , there is a $\Sigma _{n+1}$ formula that is flexible for $\Sigma _{n+1}$ over $\mathrm {T}$ . Striving for some unification, we derive a hierarchical version of Kripke’s theorem by generalizing a result of Lindström’s [Reference Lindström28, proposition 2]; which in turn is a generalization of both Mostowski’s and Kripke’s results, as well as of Scott’s famous lemma used to realize countable Scott sets as standard systems of models of $\mathrm {PA}$ [Reference Scott and Dekker41].
Theorem 4.27. Let $\mathrm {T}$ be a $\Sigma _{n+1}$ definable extension of $\mathrm {I}\Sigma _{m} + \mathrm {exp}$ , with $m\geq n$ . For every $\Sigma _m$ formula $\phi (x)$ , there is a $\Sigma _{m+1}$ formula $\unicode{x3b3} (x)$ such that for every $g : \omega \to \{0,1\}$ , if
is $\Sigma _n$ sound, then $\unicode{x3b3} (x)$ is flexible for $\Sigma _{m+1}$ over $\mathrm {T}_g$ .
Proof. Fix n and let $\phi (x) \in \Sigma _m$ , with $m\geq n$ . Let $f(s,\ulcorner \eta \urcorner ) = \ulcorner \sigma \urcorner $ iff the following holds:

1. s is binary sequence of length $k + 1$ ;

2. there is a proof p of $\lnot \forall x (\eta (x) \leftrightarrow \sigma (x))$ in $\mathrm {T} + \phi (0)^{(s)_0} + \dots + \phi (k)^{(s)_k}$ ;

3. for every $q<p$ and any $\ulcorner \sigma _0\urcorner \leq \ulcorner \sigma \urcorner $ , q is not a proof of $\lnot \forall x (\eta (x) \leftrightarrow \sigma _0(x))$ in $\mathrm {T} + \phi (0)^{(s)_0} + \dots + \phi (k)^{(s)_k}$ .
Here $(s)_k$ denotes the kth element of the sequence s.
Since $\mathrm {T}$ is $\Sigma _{n+1}$ definable, there is a deductively equivalent $\Pi _n$ definition of $\mathrm {T}$ . Hence, the relation $f(x,y) = z$ is r.e. in $\emptyset ^{(n)}$ , and therefore partial nrecursive. Let e be an nindex for f.
Let $\mathrm {Seq}_\phi (x)$ be the formula
where $l(x)$ denotes the length of x (this is the formula “x is a $l(x)$ piece of $\phi $ ”). Whenever $\phi (x)$ is $\Sigma _m$ , $\mathrm {Seq}_\phi (x)$ is $\Sigma _0(\Sigma _m)$ , and since $\mathrm {T} \vdash \mathrm {I}\Sigma _m$ , it is $\Delta _{m+1}$ in $\mathrm {T}$ . Let, by Fact 3.4, $\unicode{x3b3} (x)$ be such that
Since $\mathrm {T} \vdash \mathrm {I}\Sigma _m$ and $m\geq n$ , the formula strongly representing f in $\mathrm {T} + \mathrm {Th}_{\Pi _{n}}(\mathbb {N})$ is equivalent to a $\Sigma _{n+1}$ formula in $\mathrm {T}$ . It follows that $\unicode{x3b3} (x)$ is equivalent to a $\Sigma _{m+1}$ formula in $\mathrm {T}$ .
Suppose, for a contradiction, that there is a $g : \omega \to \{0,1\}$ and a $\sigma (x) \in \Sigma _{m+1}$ such that $\mathrm {T}_g$ is $\Sigma _n$ sound, but $\mathrm {T}_g + \forall x(\unicode{x3b3} (x) \leftrightarrow \sigma (x))$ is inconsistent. If there are more than one such $\sigma (x)$ for a given g, consider the one with the least Gödel number. There is then an initial subsequence s of g, of length $k+1$ for some k, such that p is a proof of $\lnot \forall x(\unicode{x3b3} (x) \leftrightarrow \sigma (x))$ in $\mathrm {T} + \phi (0)^{(s)_0} + \dots + \phi (k)^{(s)_k}$ . Let s be the initial subsequence of g corresponding to the least such p.
It is now clear that neither p nor any $q <p$ can be a proof of $\lnot \forall x(\unicode{x3b3} (x) \leftrightarrow \sigma _0(x))$ in $\mathrm {T} + \phi (0)^{(s)_0} + \dots + \phi (k)^{(s)_k}$ for any formula $\sigma _0(x)$ whose Gödel number is less than $ \ulcorner \sigma \urcorner $ . Hence, by definition, $f(s,\ulcorner \unicode{x3b3} \urcorner ) = \ulcorner \sigma \urcorner $ , and by Fact 3.3,
By choice of s, $\mathrm {T}_g \vdash \mathrm {Seq}_\phi (\ulcorner s \urcorner )$ , so $\mathrm {T}_g + \mathrm {Th}_{\Pi _{n}}(\mathbb {N}) \vdash \forall x (\unicode{x3b3} (x) \leftrightarrow \sigma (x))$ by an argument similar to that in the proof of Theorem 4.25. Then $\mathrm {T}_g +\mathrm {Th}_{\Pi _{n}}(\mathbb {N})$ is inconsistent, contradicting the assumption that $\mathrm {T}_g$ was $\Sigma _n$ sound.
By choosing $\phi (x)$ as $\top $ in the construction above, we obtain the expected hierarchical version of Kripke’s theorem. A similar, but not entirely correct, claim is made by Blanck [Reference Blanck3, theorem 4.8].
Corollary 4.28. Let $\mathrm {T}$ be a $\Sigma _{n+1}$ definable, $\Sigma _n$ sound extension of $\mathrm {I}\Sigma _n + \mathrm {exp}$ . For all $m\geq n$ , there is a $\Sigma _{m+1}$ formula