General Information
This is the website of the research seminar of the Computational Logic Group at the
Institute of Discrete Mathematics and
Geometry of TU Wien. The seminar
usually takes places on Wednesdays from 10:00 to 11:00 in the
Zeichensaal 1, 8th floor, green area.
The seminar is organised by
J. Aguilera,
E. Fokina and
S. Hetzl.
If you want to receive talk announcements by e-mail, please subscribe to the
mailing list of this seminar on its
administration page.
Preliminary Programme
- April 15, 2026
-
Noam Greenberg (Victoria University of Wellington)
title: t.b.a.
Archive
- April 1, 2026
-
Gian Marco Osso (University of Udine)
title: Laver forcing and ATR_0
abstract:
Using forcing to prove "effective" theorems requires an understanding of the
effective properties of the forcing notions at play. In the context of Laver
forcing one key property is "pure decision", corresponding to a partition
theorem for Laver trees. This theorem can be seen as a combinatorial common
core of determinacy and the Galvin-Prikry theorem. Restricting our attention to
open partitions, both determinacy and Galvin-Prikry are at the level of ATR_0.
I will present work in progress (joint with Alberto Marcone) on the effective
content of the Laver partition theorem for open sets.
Last Change: 2026-04-01, Stefan Hetzl.