
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.
division algorithm, Ordinal and cardinal numbers, ordinal arithmetic, ordinal multiplication, reverse mathematics, Second- and higher-order arithmetic and fragments
division algorithm, Ordinal and cardinal numbers, ordinal arithmetic, ordinal multiplication, reverse mathematics, Second- and higher-order arithmetic and fragments
| citations This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 2 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
