“Ramsey theorems, barriers and well-orderings”
Mercoledì 1 Aprile 2026, ore 16:30 - Sala Riunioni 7B1 - Lorenzo Carlucci (Sapienza Università di Roma)
Abstract
The logico-computational strength of Ramsey’s theorems is traditionally of central interest in reverse mathematics and computable combinatorics. In this talk I present some results on generalizations of Ramsey’s theorem (and of some of its consequences) to “relatively large sets” in the sense of Paris-Harrington and to “barriers” in the sense of Nash-Williams, with a particular attention to the relations with well-ordering preservation principles.
