Abstract
AbstractIn this paper we introduce a recursive notation system O(Π3) of ordinals. An element of the notation system is called an ordinal diagram. The system is designed for proof theoretic study of theories of Π3-reflection. We show that for each α < Ω in O(Π3) a set theory KP Π3 for Π3-reflection proves that the initial segment of O(Π3) determined by α is a well ordering. Proof theoretic study for such theories will be reported in [ 4].
Publisher
Cambridge University Press (CUP)
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献