What is the nature of the proof-theoretic ordinal (the smallest ordinal a theory cannot prove well-founded) for second-order arithmetic,…
What is the nature of the proof-theoretic ordinal (the smallest ordinal a theory cannot prove well-founded) for second-order arithmetic, ZFC, or stronger theories?
Open the “Model theory and formal languages” section on Wikipedia →
Source: List of unsolved problems in mathematics (CC BY-SA 4.0)