Speaker: Monroe Eskew
KGRC, University of Vienna
Will give a Logic Seminar entitled:
Uncountable universal pseudotrees
Abstract: An ongoing project of Chodounsky, Dobrinen, Eskew, and Weinert is to study the big Ramsey degrees of universal pseudotrees, which are a sort of branching version of dense linear orders. These relatively simple structures have the surprising properties of being indivisible while at the same time having no single answer on whether finite big Ramsey degrees exist for larger finite substructures— it depends on the substructure. In the hopes of generalizing this work, this talk will present the construction of the k-analogue of this pseudotree and show that it too is indivisible with respect partitions of size < k.
Date: 05-07-2024
Time: 10:30 am
Location: 231 Hayes-Healy Bldg
Originally published at math.nd.edu.