Laver's theorem
id:
laver-s-theorem-310-14522421
title:
Laver's theorem
text:
Laver's theorem, in order theory, states that order embeddability of countable total orders is a well-quasi-ordering. That is, for every infinite sequence of totally-ordered countable sets, there exists an order embedding from an earlier member of the sequence to a later member. This result was previously known as Fraïssé's conjecture, after Roland Fraïssé, who conjectured it in 1948; Richard Laver proved the conjecture in 1971. More generally, Laver proved the same result for order embeddings o
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Laver%27s_theorem
date created:
date modified:
2022-12-15T20:34:06Z
main entity:
{"identifier":"Q96387070","url":"https://www.wikidata.org/entity/Q96387070"}
image:
fields total:
13
integrity:
13