22

Let the proof theoretic ordinal $\alpha$ of a theory $T$ be the least recursive ordinal such that $T$ does not prove that $\alpha$ is well-founded. This ordinal is intended to quantify in some sense the complexity or power of a theory.

Does anyone know what is the proof theoretic ordinal of $ZFC$ or any non-trivial $ZFC$ extensions? Wikipedia says this is unknown for $ZFC$ as of 2008, but maybe there has been some recent progress? Thank you.

user40919
  • 701
  • 6
  • 9
  • 2
    I believe that proof-theoretic ordinals for much weaker theories (e.g., $\Pi^1_3$-$CA_0$, a subtheory of second-order arithmetic) are still unknown; the state of the art appears to be around $\Pi^1_2$-$CA_0$, if I understand the state of things correctly. – Noah Schweber Oct 05 '13 at 20:03
  • 3
    No real progress towards this goal, in the sense that proof theory has a long way to go to reach $\mathsf{ZFC}$ or comparable theories. In some of his latest talks (on the consistency of $\mathsf{PA}$), Cohen suggested he had a way of understanding this ordinal $\alpha$, but I could never see a coherent presentation, and I doubt there was something sufficiently developed to allow us to unambiguously identify an ordinal as the proof-theoretic ordinal for $\mathsf{ZFC}$. – Andrés E. Caicedo Oct 05 '13 at 20:04
  • For example, already an analysis of $\Pi^1_2$-$CA_0$ by Rathjen required very complicated ordinal notations, and recently (see the intro to http://miami.uni-muenster.de/servlets/DerivateServlet/Derivate-5965/diss_stegert.pdf) a serious error was found (and patched, I think) in Rathjen's work around this level. – Noah Schweber Oct 05 '13 at 20:05
  • That's helpful, thank you both Noah and Andres. I will take a look at that Rathjen reference. – user40919 Oct 05 '13 at 20:35

1 Answers1

15

As Andres and I have stated in the comments, we are still nowhere near a proof-theoretic analysis of $ZFC$ or similar theories; even full second-order arithmetic remains well out of reach.

The paper "The Art of Ordinal Analysis" by Michael Rathjen does a good job of both describing ordinal analyses which have succeeded (e.g., $PA$), and showing how new difficulties arise as we climb towards higher and higher comprehension axioms (still around the level of $\Pi^1_2$-$CA_0$ by the end of the paper). I think this might be worth reading, if you want an explanation of why finding proof-theoretic ordinals of strong theories is "hard."

Noah Schweber
  • 18,932
  • Thank you Noah. As a total lay-person to ordinal analysis, is understanding the ordinal for $SOA$ seen as a necessary or very helpful stepping stone for finding the ordinal for $ZFC$? – user40919 Oct 05 '13 at 20:45
  • I'll also accept this answer pending any new results on $\alpha$ coming out of the wood-work :) – user40919 Oct 05 '13 at 20:49
  • 8
    Re: total lay-person-ness, let me clarify something: in the realm of proof-theoretic ordinals, I don't actually "know" anything. On the plus side, I have read a number of survey articles, and nodded my head sagely through dozens - dozens! - of conversations on the subject. :P – Noah Schweber Oct 05 '13 at 20:54
  • 1
    That said, I think that understanding the ordinal for $SOA$ (or even its fragments) is thought to be necessary for finding the ordinal for $ZFC$, for at least three reasons: – Noah Schweber Oct 05 '13 at 20:55
  • 2
    First of all, since $SOA$ is a subtheory of $ZFC$, all the difficulties of analyzing $SOA$ will surely show up in trying to analyze $ZFC$; so at the very least, $SOA$ should be far easier to understand than $ZFC$. (In particular, I expect $SOA$ to be analyzed in my lifetime; I do not expect that of $ZFC$, and in fact would be very surprised if I lived to see it.) – Noah Schweber Oct 05 '13 at 20:56
  • 2
    Second, $SOA$ and $ZFC$ aren't really that alien; already in analyzing subtheories of $SOA$, it has been extremely useful to recast them as weak set theories, such as $KP$; see section 2.2 of Rathjen's paper. So in analyzing bigger and bigger subsystems of $SOA$, we're already "climbing towards" $ZFC$ in some sense; it seems reasonable that this will be how we eventually get to $ZFC$. So then not only is $SOA$ likely easier than $ZFC$, it is probably an actual "step along the way." – Noah Schweber Oct 05 '13 at 20:59
  • 2
    Finally, the techniques used in ordinal analyses have been revolutionized multiple times already in the course of getting to (somewhere around) $\Pi^1_2$-$CA_0$. The twist that is dearest to my heart is the use of uncountable cardinals in ordinal notations developed by Bachmann (mentioned by Rathjen on pp. 11), but Rathjen's article describes a number of interesting developments. The point is, "ordinal analysis" is not one specific tool that could reach $ZFC$ if we just put more effort into it; rather, it has needed many fundamentally new ways of thinking even to get up to $\Pi^1_2$-$CA_0$. – Noah Schweber Oct 05 '13 at 21:04
  • 2
    What does this mean? Well, ultimately, in coming up with these new approaches to ordinal analysis, I think one of the key things we'll need is good guesses about what might work. Trying to find the proof-theoretic ordinal of $ZFC$, there is simply too much we don't know how to do: I don't think spinning one's wheels trying to study $ZFC$ directly will pay off. By contrast, $SOA$ is far out of reach, but close enough that studying it right now (or soon) might actually pay off. We'll need the tools we develop in analyzing $SOA$ to analyze $ZFC$, anyways; and it might be much easier (cont'd) – Noah Schweber Oct 05 '13 at 21:12
  • to find those tools when looking at $SOA$, rather than $ZFC$, just because when fewer new ideas are needed, they'll be easier to find. – Noah Schweber Oct 05 '13 at 21:13
  • @Noah, the "interesting developments" you mentioned at Oct 5 '13 at 21:04 are regarding ordinal notations and are mentioned in "The Art of Ordinal Analysis"? – Guillermo Mosse Apr 11 '18 at 16:52
  • 1
    @SeñorBilly Yes. Rathjen's whole article describes a number of interesting things. – Noah Schweber Apr 11 '18 at 17:56