A theorem from Rival and Sands and reverse mathematics
Marta Fiori Carones (LMU Munich)
Abstract: In 1980 Ivan Rival and Bill Sands proved that for each infinite poset P with finite width (i.e. such that there is a fixed finite bound on the size of antichains in P) there is an infinite chain C ⊆ P such that each element of P is comparable to none or to infinitely many elements of C. Moreover, if P is countable, C can be found such that each element of P is comparable to none or to cofinitely many elements of C. We prove that some versions of the previous theorem are equivalent to the Ascending/descending sequence principle or to related known principles of the reverse mathematics zoo. (Joint work with Alberto Marcone, Paul Shafer and Giovanni Soldà)
logic
Audience: researchers in the topic
Computability theory and applications
Series comments: Description: Computability theory, logic
The goal of this endeavor is to run a seminar on the platform Zoom on a weekly basis, perhaps with alternating time slots each of which covers at least three out of four of Europe, North America, Asia, and New Zealand/Australia. While the meetings are always scheduled for Tuesdays, the timezone varies, so please refer to the calendar on the website for details about individual seminars.
Organizers: | Damir Dzhafarov*, Vasco Brattka*, Ekaterina Fokina*, Ludovic Patey*, Takayuki Kihara, Noam Greenberg, Arno Pauly, Linda Brown Westrick |
*contact for this listing |