We are happy to welcome Giovanni Solda amongst us. He is joining Swansea University as a postdoctoral researcher and will be working with Arno Pauly.
Giovanni was awarded 1 of 15 London Mathematical Society Early Career Fellowships, which provide 6 months of funding to fresh UK PhD graduates in math to spend at any institution across the world.
Congratulations to Jay Morgan for passing his PhD viva on
“Trustable Machine Learning Systems: Strategies to use expert domain knowledge to improve the performance of Deep Learning systems”.
The University of Birmingham is hosting this year’s CCC 2021 Continuity, Computability, Constructivity: From Logic to Algorithms on 20-24 September 2021. There is a special session in honour of Ulrich Berger taking place on Tuesday as a part of this conference.
We are glad to welcome Troy Astarte to our Computer Science Department and the Theory Group.
We are glad to welcome Pierre Pradic, who is joining the Swansea University Computer Science Department and the Theory Group this year.
Congratulations to Hoda Abbasizanjani for passing her PhD viva on
“The combinatorics of minimal unsatisfiability: connecting to graph theory”.
Arved will give a talk on Propagator Networks for Unification and Proof Search on Monday (29.03) and Jay will present his research on Trustable Machine Learning Systems on Tuesday (30.03).
Today Adam Ó Conghaile will give a talk on “Games & Comonads in Finite Model Theory” as a part of our Theory Seminar Series.
Abstract. Model-comparison games (such as Ehrenfeucht-Fraïssé games, pebble games and modal bisimulation) capture various approximations to isomorphism and homomorphism between structures. These approximations are important and well-studied in computer science for their connections with logic and algorithms but their descriptions are often ad hoc and unified approach to these games is lacking in classical finite model theory. Game comonads, introduced by Abramsky, Dawar & Wang [1], provide a categorical semantics for these games which reveals connections between these games and relates them in a surprising and elegant way to structural parameters such as treewidth.
In my talk, I will survey the landscape of model-comparison games and developments in this new comonadic perspective to them, including contributions from my recent work with Anuj Dawar on game comonads for logics with generalised quantifiers. [2]
[1] – S. Abramsky, A. Dawar, P. Wang The pebbling comonad in finite model theory, LiCS 2017
[2] – A. Ó Conghaile, A. Dawar Game comonads & generalised quantifiers, CSL 2021
Roger Hindley will give a talk on “100 Years of Combinatory Logic” on Friday, 22 January 2021 as a part of the World Logic Day celebration here in Swansea.
Time: Jan 22, 2021 10:00 AM London
Join Zoom Meeting by following this link.
Meeting ID: 965 2656 4560 Passcode: 411495
UNESCO proclaimed World Logic Day in 2019 in association with the International Council for Philosophy and Human Sciences (CIPSH), to enhance public understanding of logic and its implications for science, technology and innovation.
A complete list of WLD 2021 events can be found at http://www.wld.cipsh.international/wld.html.
