Countryman line
From Wikipedia, the free encyclopedia
A Countryman line is an uncountable linear ordering whose square is the union of countably many chains. The existence of Countryman lines was first proven by Shelah. Shelah also conjectured that, assuming PFA, every Aronszajn line contains a Countryman line. This conjecture, which remained open for three decades, was proven by Justin Moore.
[edit] References
- Shelah, Saharon (1976). "Decomposing uncountable squares to countably many chains". Journal Combinatorial Theory Series A 21 (1): 110–114. doi:.
- Moore, Justin (2006). "A five element basis for the uncountable linear orders.". Annals of Mathematics (2) 163 (2): 669–688.
 |
This mathematical logic-related article is a stub. You can help Wikipedia by expanding it. |
