Maximal order types of well partial orders
David Belanger (National University of Singapore)
Abstract: We outline a general approach for computing (bounds on) maximal order types of certain well partial orders. This is part of an ongoing project to generalize and extend work of van der Meeren characterising the Bachmann-Howard ordinal as such an order type. Joint with Andreas Weiermann.
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 |