Abstract
AbstractFor several subsystems of second order arithmeticTwe show that the proof-theoretic strength ofT+ (bar rule) can be characterized in terms ofT+ (bar induction)□, where the latter scheme arises from the scheme of bar induction by restricting it to well-orderings with no parameters. In addition, we demonstrate that,ACA0+ (bar rule) andACA0+ (bar induction)□prove the same-sentences.
Publisher
Cambridge University Press (CUP)
Cited by
12 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献