加载中…
In arXiv:2208.12944 it is shown that an ordinal is an upper bound for the proof-theoretic ordinal of a set theory . In this paper we show that a second order arithmetic proves the wellfoundedness up to for each . It is easy to interpret in .

生成讲解博客的中文版本

生成AI智能校验的中文版本