Abstract
AbstractThis paper uses the framework of reverse mathematics to analyze the proof theoretic content of several statements concerning multiplication of countable well‐orderings. In particular, a division algorithm for ordinal arithmetic is shown to be equivalent to the subsystem ATR0.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
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
