A note on the theory of well orders
Logic
2025-03-26 v4 Logic in Computer Science
Abstract
We give a simple proof that the first-order theory of well orders is axiomatized by transfinite induction, and that it is decidable.
Cite
@article{arxiv.2405.05779,
title = {A note on the theory of well orders},
author = {Emil Jeřábek},
journal= {arXiv preprint arXiv:2405.05779},
year = {2025}
}
Comments
4 pages; accepted to the Bulletin of Symbolic Logic