# On Pudlak's “Life in an Inconsistent World”

In his Logical Foundation of Mathematics and Computational Complexity (2013), Pavel Pudlak invites the readers to ponder about fictitious people whose natural numbers are nonstandard. His exposition is included in Section 6.1, under the subsection Interlude - Life in an Inconsistent World.

He first (implicitly) assumes the Peano Arithmetic $\mathrm{PA}$ is consistent. The theory $\mathrm{PA + \neg Con(PA)}$ is consistent by the Second Incompleteness Theorem, thus having a model $M$. He then urges us to think about a world $\mathcal W$ where the natural numbers are $M$.

He explains what kind of unnerving phenomenon occurs in $\mathcal W$.

[...] Suppose that these people discover one of the proofs of contradiction in $\mathrm{PA}$. Then they would be very frustrated when trying to determine the theory of the natural numbers. On the one hand they would see that the axioms of Peano Arithmetic are satisfied in their natural numbers, on the other hand they would know that the axioms are inconsistent. Since the axioms are true, but one can still derive a contradiction from them, they would conclude that logic fails. [...]

The problem is that I don't quite understand the passage. In particular, it is unclear what logical system the people in $\mathcal W$ use in writing "the proofs of contradiction $\mathrm{PA}$."

I'd be grateful if you could explain the passage more technically and more in detail.

-

To talk about these things semantically, it is easier to work in the system $\mathsf{ACA}_0$ of second-order arithmetic. This system is a conservative extension of Peano arithmetic for sentences in the language of Peano arithmetic, but $\mathsf{ACA}_0$ is able to deal directly with satisfaction (truth) predicates. If you don't know the details, for the rest of this post you can just treat $\mathsf{ACA}_0$ as a second-order version of Peano arithmetic.

A key point about $\mathsf{ACA}_0$ is that it can be axiomatized with a finite set of axioms. So we do not need to worry about "nonstandard" axioms when we look at nonstandard models: we can just assume that the finite set of axioms is used. This is not true of Peano arithmetic, which complicates Pudlak's argument - Peano arithmetic is not finitely axiomatizable. The fact that $\mathsf{ACA}_0$ is finitely axiomatizable is a good reason to look at it instead.

Suppose $M$ is a model of $\mathsf{ACA}_0 + \lnot \text{Con}(\mathsf{ACA}_0)$. This means that, in $M$, there is a natural number $c$ that codes a proof of $\lnot \text{Con}(\mathsf{ACA}_0)$. The proof coded by $c$ uses normal first-order logic, using just the axioms from $\mathsf{ACA}_0$. Because we can use a deductive system for first-order logic that only has a finite number of deduction rules, and because $\mathsf{ACA}_0$ really is consistent, $c$ must code a proof of nonstandard length when viewed from outside $M$.

Following Pudlak, let's assume that someone living in $M$ recognizes that all of the (finite number of) axioms of $\mathsf{ACA}_0$ are true in $M$, but they also recognize that $c$ codes a proof of $0=1$ from these axioms. Why is this not a contradiction?

For the person in $M$ to see the contradiction, they would need to prove by induction that, for each coded proof and every $n$, if all the statements on lines $0, 1, \ldots, n$ of a proof are true, then so is the statement on line $n+1$ (assuming the proof has $n+1$ or more lines). If they could prove that, they would be able to prove that $0=1$ is true in $M$, even though they know $0=1$ is not true in $M$, because $M$ satisfies $\mathsf{ACA}_0$.

The problem for the person in $M$ is that the induction principle needed in that proof is part of the $\Sigma^1_1$ induction scheme, and that scheme is not provable from $\mathsf{ACA}_0$. In fact, $\mathsf{ACA}_0$ plus the $\Sigma^1_1$ induction scheme proves $\text{Con}(\mathsf{ACA}_0)$. So the person in $M$ will see that $\Sigma^1_1$ induction fails.

That could be interpreted as "logic fails" if the person in $M$ thinks that $\Sigma^1_1$ induction is part of logic. Put more sharply, the person in $M$ would certainly think that "first-order logic is not sound" in the sense that a false sentence may be derived from true sentences in a "finite" (in $M$) number of steps. (At the same time, we know that $\mathsf{ACA}_0$ proves the soundness theorem for first-order logic - but that refers to something else, in this context.)

-
I have a question on paragraph $3$. What prevents the proof to start with an instance of a propositional tautology that happens to have nonstandard length? Don't we need an additional pruning argument to ensure that any such proof can be replaced with one of the form you describe? –  Andres Caicedo Mar 10 '14 at 3:25
How is it possible that proof method is sound for finite length argument but is not sound for infinite (nonstandard) length? Soundness is proved by induction so it should work for infinite arguments. –  Trismegistos Mar 10 '14 at 10:56
@Andres: here is a way, I think, to obtain what I want. Use a tableau proof system, and rewrite the theory in a language with only relation symbols (no function symbols). Then we still have a finite number of axioms (no axiom schemes) for $\mathsf{ACA}_0$, and a finite number of inference rules for the logic. The only inference rules that allow for any free choice are the ones that choose names of variables to instantiate quantifiers. So, if $c$ had finite length, by just changing the names of the variables that were substituted we would obtain an actual proof of $0=1$, contradiction. ... –  Carl Mummert Mar 10 '14 at 11:08
@Trismegistos: it is true that even an argument of infinite length would be sound if the argument is well founded. We need the assumption of well foundedness to make the inductive proof go through. But the "coded proof" $c$ will not actually be well founded, when viewed from outside $M$. The situation inside $M$ is different: $M$ thinks $c$ is finite, so $M$ thinks $c$ is well founded. As a result, in this case $M$ will think that some induction principle fails to hold - the same principle we would use outside $M$ to prove soundness, which is $\Sigma^1_1$ induction in this setting. –  Carl Mummert Mar 10 '14 at 11:21
@Pteromys: $\mathsf{ACA}_0$ doesn't include $\Sigma^1_1$ induction. –  Carl Mummert Mar 23 '14 at 10:13

A (Hilbert style) proof of $\phi$ from a (first order) theory $T$ is a finite sequence of sentences $\phi_1,\dots,\phi_n$, where $\phi$ is $\phi_n$, and each $\phi_i$ is either an instance of a logical axiom, a sentence in $T$, or comes from previous sentences in the sequence via modus ponens or one of the logical rules dealing with quantifiers.

There are variants of this definition, but they are all very similar, and what follows can be straighforwardly adapted to apply to them as well.

Working within $\mathsf{PA}$, where we have numbers but no sentences, or sequences, we need to make do via coding. This requires some care. The key property of $\mathsf{PA}$ being used is that we can carry out recursive constructions, as we can code finite sequences of numbers via numbers. This is not entirely obvious, see here for an example. We use this as follows: We start by selecting a recursive set of numbers to code the symbols of our language. Once this is done, we can code strings of symbols, formulas, and sequences of formulas. We can associate to $\mathsf{PA}$ a recursive set of numbers that code the sentences of $\mathsf{PA}$, and we have a formula $\psi(x,y)$ that holds iff $x$ is the code of a sentence, and $y$ is the code of a proof in $\mathsf{PA}$ of the sentence coded by $x$. (The way that recursive sets and recursive functions are represented in $\mathsf{PA}$ also requires some technical care. The references I mention in the link above address all these details carefully.) Moreover, whenever $\mathsf{PA}$ proves $\phi$, we can code the proof by a number $m$, and $\phi$ by a number $n$, and we can prove in $\mathsf{PA}$ that $\psi(n,m)$ holds. (More formally, the statement $\forall x\,\forall y\,(\tau_n(x)\land\tau_m(y)\to\psi(x,y))$ is provable. Here, $\tau_k(x)$ is "the" formula stating that $x$ "is" $k$.) Also, given any numbers $n,m$, if $n$ does not code a sentence, or if it does but $m$ does not code a proof of that sentence, then $\mathsf{PA}$ also proves $\lnot\psi(n,m)$.

Now, the point is this: In non-standard models, there will be non-standard numbers $n$ and $m$ such that $\psi(n,m)$ is satisfied in the model. This is what is meant when we say that the people of the model see a proof of "the sentence coded by $n$". In the model $\mathcal M$ Pudlak is describing, if $n$ is the code for $0=1$, there is a "proof" $m$ with $\psi(n,m)$ holding in $\mathcal M$. This $m$ is necessarily nonstandard. Maybe it has nonstandard length, so it is not really coding a sequence. Or maybe some of the "axioms" used in the "sequence" coded by $m$ are non-standard, so they are not really sentences. Or maybe both the length of the sequence and the lengths of some of the sentences used there are non-standard.

-
Thank you. Now I'm closer to what Pudlak meant. Having read the book carefully, I noticed that he mentioned a contradiction proof containing a sentence of nonstandard length, but he didn't write about a contradiction proof itself being of nonstandard length. Why do you think he did not? –  Pteromys Mar 10 '14 at 1:44
Actually, I disagree with "they would see that the axioms of Peano Arithmetic are satisfied in their natural numbers". Take the induction axioms. For each formula $\phi(x,\vec y)$, induction for $\phi$ holds in $\mathcal M$ (so "its inhabitants see this"). On the other hand, for some nonstandard $\phi$, induction for $\phi$ fails. That is, there is a nonstandard number $k$ that in $\mathcal M$ satisfies the formula saying that $k$ codes a formula $\phi$, and induction for $\phi$ fails. (Cont.) –  Andres Caicedo Mar 10 '14 at 1:45
The inhabitants of $\mathcal M$ "see" $k$ as a regular number, or them there is no concept of "nonstandard" so, for them, $\mathcal M$ does not satisfy $\mathsf{PA}$. –  Andres Caicedo Mar 10 '14 at 1:47
@Pteromys I am not sure. One scenario is that if a "proof" of a contradiction only uses standard sentences, then (from the outside) maybe we should be able to extract a (true) proof of a contradiction from it, which is impossible since $\mathsf{PA}$ is consistent, and therefore the "proof" should invoke nonstandard sentences. But I do not see at the moment how to formalize this idea. It may also be that Pudlak simply only remarked on the length of the sentences, without wanting to imply by omission that the length of the proofs was not an issue as well. –  Andres Caicedo Mar 10 '14 at 1:56
@Andres: if $\Sigma^1_1$ induction fails, then there is no reason to think that, just because some axioms are all satisfied, everything provable from those axioms is also satisfied. The normal proof otherwise uses $\Sigma^1_1$ induction to construct truth predicates for larger and larger subtheories. In other words, I do not see why the proof of $0=1$ has to use nonstandard axioms; perhaps it just has a nonstandard length. I may write an answer about this. –  Carl Mummert Mar 10 '14 at 2:03

It is a common figure of speech to re-present a proposition $P$ that is independent of a particular formal system $S$ and of a logical form that can be decided by examples (e.g., displaying a solution proves an equation is solvable, and writing down a proof of $0=1$ demonstrates inconsistency) as having examples that are "nonstandard" and exist in a "nonstandard model".

This kind of talk about nonstandard witnesses is the semantic equivalent restatement (by the completeness theorem) of the syntactic concept of a statement being undecidable. The completeness theorem is a correspondence between syntax and semantics for first-order theories.

Adding an independent statement to a system preserves consistency. The completeness theorem asserts that the system plus the independent statement (or its negation) has a model. If the addition is an undecidable existential statement $\exists x Q(x)$ that model will contain an element $x$ for which $Q(x)$ is true (a witness). If the addition is the negation of an undecidable universal statement $\forall y Q(y)$ that model will contain an element $y$ for which $Q(y)$ is false (a counterexample). For more complicated nested quantifiers the model might have to contain larger structures such as sets and functions and other collections of many $x$'s in order to (in)validate $P$, they no longer have to be single elements and there is not necessarily a simple word like "counterexample" to describe the relation of the truth/falsity certificate to the proposition.

The words true and standard refer to a situation where a more powerful supersystem of $S$ (such as a set theory, when $S$ is a theory of arithmetic) proves that $S$ has a preferred (thus "standard") type of model, perhaps a unique one, satisfying additional properties, and also can prove that the $S$-independent statement is true in that model (and, perhaps, also true in every model of the supersystem).

The nonstandard vocabulary is most common when the base system is a theory of arithmetic such as $PA$, since in that case developed language and intuitions of nonstandard models of arithmetic can be applied. These are not random extensions where you "add more stuff" to a standard model, but have very constrained order-types and a clear enough notion of the additional positive integers being infinitely large yet with well-defined properties.

In this metaphor, a nonstandard inconsistency proof can exist for a consistent system, but it has length $L$ for $L$ a nonstandard (therefore infinite) positive integer.

What is provable in the system $S$ only involves proofs whose lengths are measured by standard finite integers. That this coexists with nonstandard infinitely long proofs is because the latter reflect what is true in the model, and truth is a weaker property than being provable. Any nonstandard $L$ that is the length (or code) of an inconsistency proof would also admit proofs that $L >1$, $L > 2$, $L>3$ and $L > n$ for any finite $n$ that can be written down in a finite number of symbols.

From a more skeptical point of view, the passage from the book is merely an evocative reference to the undefined concept of people "seeing that their natural numbers are a model of Peano Arithmetic" (which also assumes it is well-defined to talk about "their natural numbers" separately from the PA-like system in their hypothetical world).

-
What do you mean that truth is weaker property than provability? –  Trismegistos Mar 10 '14 at 10:49
Provability, according to the completeness theorem, is truth in all models. –  zyx Mar 10 '14 at 18:45