Misplaced Pages

Countryman line: Difference between revisions

Article snapshot taken from Wikipedia with creative commons attribution-sharealike license. Give it a read and then ask your questions in the chat. We can research this topic together.
Browse history interactively← Previous editNext edit →Content deleted Content addedVisualWikitext
Revision as of 12:49, 23 May 2022 edit81.110.184.237 (talk)No edit summary← Previous edit Revision as of 09:47, 1 January 2025 edit undoTakuyaMurata (talk | contribs)Extended confirmed users, IP block exemptions, Pending changes reviewers89,986 edits See also: *Walks on ordinalsNext edit →
Line 1: Line 1:
In mathematics, a '''Countryman line''' (named after Roger Simmons Countryman Jr.) is an ] ] whose square is the union of ] many ]. The existence of Countryman lines was first proven by ]. Shelah also conjectured that, assuming ], every ] contains a Countryman line. This conjecture, which remained open for three decades, was proven by ]. In mathematics, a '''Countryman line''' (named after Roger Simmons Countryman Jr.) is an ] ] whose square is the union of ] many ]. The existence of Countryman lines was first proven by ]. Shelah also conjectured that, assuming ], every ] contains a Countryman line. This conjecture, which remained open for three decades, was proven by ].

== See also ==
*]


==References== ==References==

Revision as of 09:47, 1 January 2025

In mathematics, a Countryman line (named after Roger Simmons Countryman Jr.) 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.

See also

References


Stub icon

This mathematical logic-related article is a stub. You can help Misplaced Pages by expanding it.

Categories: