Computability theory is one of the main branches of mathematical logic, with significant connections to algebra, analysis, topology, and theoretical computer science. The field includes large numbers of active researchers from the United States and Italy, who have enjoyed a longstanding, fruitful collaboration. This special session seeks to recognize and continue this connection. It will bring together senior and young researchers from both countries to discuss recent developments and new research directions, and to stimulate future work.
Everyone interested in attending the special session, including invited speakers and organizers, must register on the conference website and pay the registration fee.
Lorenzo Carlucci, Università di Roma “La Sapienza”.
Vittorio Cipriani, Technische Universität Wien.
Valentino Delle Rose, Università di Roma “La Sapienza”.
Ekaterina Fokina, Technische Universität Wien.
Guido Gherardi, Università di Bologna.
Jun Le Goh, National University of Singapore.
Valentina Harizanov, George Washington University.
Josiah Jacobsen-Grocott, University of Wisconsin–Madison.
Julia Knight, University of Notre Dame.
Elvira Mayordomo, Universidad de Zaragoza/Iowa State University.
Luca San Mauro, Università degli studi di Bari Aldo Moro.
Arno Pauly, Swansea University.
Isabella Scott, University of Chicago.
Paul Shafer, University of Leeds.
Giovanni Soldà, Universiteit Gent.
Manlio Valenti, Swansea University.
Full program with abstracts (PDF).
| 11:00–11:45 | Manlio Valenti | Minimal covers in the Weihrauch degrees |
| 12:00–12:20 | Isabella Scott | Computability theory and existentially closed groups |
| 12:30–12:50 | Vittorio Cipriani | Characterizing learnability for families of structures |
| 14:30–15:15 | Ekaterina Fokina | On structures with non-computable presentations |
| 15:30–15:50 | Elvira Mayordomo | On normality, supernormality, finite state dimension, and point to set principles |
| 16:00–16:20 | Giovanni Soldà | Nash-Williams theorem for sequences of finite range in \(\mathsf{ATR}_0\) |
| 17:00–17:50 | Lorenzo Carlucci | From combinatorial theorems to well-ordering principles |
| 11:30–11:50 | Arno Pauly | Weihrauch degrees of indivisibility |
| 12:00–12:20 | Jun Le Goh | What can be uniformly computed from descending sequences? |
| 12:30–12:50 | Guido Gherardi | Computability of the Whitney Extension Theorem |
| 14:30–15:15 | Julia Knight | Computable \(\Pi_2\) Scott sentences |
| 15:30–15:50 | Luca San Mauro | A new way of classifying word problems |
| 16:00–16:20 | Josiah Jacobsen-Grocott | Degrees and applications of e-pointed trees |
| 17:00–17:20 | Valentina Harizanov | Generic and coarse computability of Abelian \(p\)-groups |
| 17:30–17:50 | Valentino Delle Rose | On the complexity of some topological properties in highly computable graphs |
| 18:00–18:20 | Paul Shafer | Revisiting the reverse mathematics of the Tietze extension theorem: preserving suprema |
Damir Dzhafarov, University of Connecticut.
Alberto Marcone, Università di Udine
Mariya Soskova, University of Wisconsin–Madison