Laver's theorem (original) (raw)
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 of countable unions of scattered orders.
| Property | Value |
|---|---|
| dbo:abstract | 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 of countable unions of scattered orders. In reverse mathematics, the version of the theorem for countable orders is denoted FRA (for Fraïssé) and the version for countable unions of scattered orders is denoted LAV (for Laver). In terms of the "big five" systems of second-order arithmetic, FRA is known to fall in strength somewhere between the strongest two systems, -CA0 and ATR0, and to be weaker than -CA0. However, it remains open whether it is equivalent to ATR0 or strictly between these two systems in strength. (en) |
| dbo:wikiPageID | 63406456 (xsd:integer) |
| dbo:wikiPageLength | 3002 (xsd:nonNegativeInteger) |
| dbo:wikiPageRevisionID | 1082653807 (xsd:integer) |
| dbo:wikiPageWikiLink | dbr:Roland_Fraïssé dbr:Reverse_mathematics dbr:Dushnik–Miller_theorem dbr:Scattered_order dbc:Order_theory dbr:Countable_set dbr:Order_theory dbr:Order_embedding dbr:Total_order dbr:Well-quasi-ordering dbr:Richard_Laver dbr:Sequence dbr:Second-order_arithmetic |
| dbp:wikiPageUsesTemplate | dbt:R dbt:Reflist |
| dct:subject | dbc:Order_theory |
| rdfs:comment | 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 of countable unions of scattered orders. (en) |
| rdfs:label | Laver's theorem (en) |
| owl:sameAs | wikidata:Laver's theorem https://global.dbpedia.org/id/C189N |
| prov:wasDerivedFrom | wikipedia-en:Laver's_theorem?oldid=1082653807&ns=0 |
| foaf:isPrimaryTopicOf | wikipedia-en:Laver's_theorem |
| is dbo:wikiPageRedirects of | dbr:Fraïssé's_conjecture |
| is dbo:wikiPageWikiLink of | dbr:Better-quasi-ordering dbr:Dushnik–Miller_theorem dbr:Scattered_order dbr:Order_embedding dbr:Well-quasi-ordering dbr:Fraïssé's_conjecture dbr:Richard_Laver dbr:Slicing_the_Truth |
| is foaf:primaryTopic of | wikipedia-en:Laver's_theorem |