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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
