A Short Proof of the Irreflexivity Conjecture


and proved that < is a linear ordering. Laver’s proof uses a large cardinal assumption that is not provable in ordinary mathematics. In a series of papers [ ], Dehornoy showed (without any additional assumption) that any distinct a, b ∈ A are comparable in < and reduced the word problem to the problem of existence of a distributive one-generated algebra A… (More)