# Is the theory for $\mathbb{R}$ categorical or not?

The usual axioms of $$\mathbb{R}$$ consist of the ordered field axioms plus the least upperbound property. Because the least upperbound property is a statement that quantifies over sets of real numbers, people often say that it is a second-order logic statement, which makes the theory of real numbers categorical.

However, from the point of view of ZFC set theory, sets are simply objects of set theory, so quantification over sets (like in the least upperbound property) is a first-order statement. Then the theory of real numbers cannot be categorical.

The same kind of confusion can be posed when we're talking about natural numbers. The second-order logic Peano axioms include the induction axiom, which quantifies over properties of natural numbers. But we can recast this as a statement that quantifies over sets in the framework of set theory in first-order logic, and then it isn't clear whether or not (a certain version of) the Peano axioms leads to a categorical theory.

I would want someone with more understanding than me to clarify this situation. What is the right, straightforward way of thinking about this that steers clear of confusion?

• The immediate thing that comes to mind is that the second order theory of the real line might have more models than the full first order theory of sets allows for in ZFC. Not sure if that is true. For example, ZFC means you'd have choice, which might ensure real numbers exist with certain properties. Even if you build the real numbers in ZF without choice, there might be other properties of the reals in that model which are not true in a second order theory. But I'm far from an expert, and I can't think of such models. Commented Nov 9, 2022 at 23:40
• In general, any consistent second order theory can be modeled in some version of set theory. But it isn't clear that means second order theories are always first order theories in disguise. Commented Nov 9, 2022 at 23:42
• I am not sure exactly what you are asking. Is it relevant that ZFC can prove that any two archimedean ordered fields are isomorphic (this is a consequence of Hölder's theorem that any archimedean ordered group can be embedded in the reals). So as far as ZFC is concerned the second order characterisation of the reals determines a structure that is unique up to isomorphism. Commented Nov 10, 2022 at 0:03
• The fact that Dedekind completeness is a 2nd order property doesn’t make the theory categorical. It just allows for that possibility in the sense that it’s impossible for a first order theory with infinite models to be categorical. Categoricity still needs to be proven. Commented Nov 10, 2022 at 0:50

In a given model of $$\sf ZF$$, the real numbers are unique up to isomorphism. But as soon as you reduced the problem to the first order theory of $$\sf ZF$$, you essentially have to contend with the fact that different models of $$\sf ZF$$ can exist, and they may have wildly different real numbers.
Let $$T$$ be the first-order theory of $$\mathbb{R}$$. $$T$$ is not categorical. To see this, consider the theory $$T$$, but add in a new constant symbol $$c$$ and, for each $$n \in \mathbb{N}$$, the axiom $$n < c$$. This theory is clearly finitely satisfiable - given $$T$$ plus the axioms $$n_1 < c, n_2 < c, \ldots, n_m < c$$, we can take as a model $$\mathbb{R}$$ with $$c = \max(n_1, \ldots, n_m) + 1$$.
Ultimately, the notion of being “categorical” depends on which logic we are using and how we model this logic. If we work in first-order logic with ordinary semantics, many theories, such as those of $$\mathbb{N}$$ and $$\mathbb{R}$$, are not categorical. The same holds if we work in second-order logic with Henkin semantics, as this amounts to treating second-order logic as (many-sorted) first-order logic, so the compactness theorem still applies (so our above argument still shows that the theory of $$\mathbb{R}$$ isn’t categorical). In fact, using the compactness theorem, we can prove the upward Lowenheim-Skolem theorem, which proves that any theory with an infinite model isn’t categorical.