A note on the theory of well orders
arXiv:2405.05779 · doi:10.1017/bsl.2024.53
Abstract
We give a simple proof that the first-order theory of well orders is axiomatized by transfinite induction, and that it is decidable.
4 pages; accepted to the Bulletin of Symbolic Logic