Weak well orders and Fraïssé's conjecture

The notion of well order admits an alternative definition in terms of embeddings between initial segments. We use the framework of reverse mathematics to investigate the logical strength of this definition and its connection with Fraïssé’s conjecture, which has been proved by Laver. We also fill a small gap in Shore’s proof that Fraïssé’s conjecture implies arithmetic transfinite recursion over ${\mathbf{R}\mathbf{C}\mathbf{A}}_0$, by giving a new proof of ${\mathrm{\Sigma }}_2^0$-induction.