| 2019 | Presburger arithmetic with stars, rational subsets of graph groups, and nested zero tests. | Christoph Haase, Georg Zetzsche |
| 2019 | On the Existential Theories of Bchi Arithmetic and Linear p-adic Fields. | Florent Gupin, Christoph Haase, James Worrell |
| 2019 | Canonisation and Definability for Graphs of Bounded Rank Width. | Martin Grohe, Daniel Neuen |
| 2019 | Descriptive complexity for minimal time of cellular automata. | Etienne Grandjean, Tho Grente |
| 2019 | A Probabilistic and Non-Deterministic Call-by-Push-Value Language. | Jean Goubault-Larrecq |
| 2019 | Describing free $\omega$ -categories. | Simon Forest, Samuel Mimram |
| 2019 | Backprop as Functor: A compositional perspective on supervised learning. | Brendan Fong, David I. Spivak, Rmy Tuyras |
| 2019 | A type theory for cartesian closed bicategories (Extended Abstract). | Marcelo Fiore, Philip Saville |
| 2019 | Lambda Calculus and Probabilistic Computation. | Claudia Faggian, Simona Ronchi Della Rocca |
| 2019 | Completeness for Game Logic. | Sebastian Enqvist, Helle Hvid Hansen, Clemens Kupke, Johannes Marti, Yde Venema |
| 2019 | History-Dependent Nominal μ-Calculus. | Clovis Eberhart, Bartek Klin |
| 2019 | Realizability in the Unitary Sphere. | Alejandro Daz-Caro, Mauricio Guillermo, Alexandre Miquel, Benot Valiron |
| 2019 | The convex hull of finitely generable subsets and its predicate transformer. | Mohammad-Javad Davari, Abbas Edalat, Andr Lieutier |
| 2019 | The Hierarchy of Hyperlogics. | Norine Coenen, Bernd Finkbeiner, Christopher Hahn, Jana Hofmann |
| 2019 | Graph Planning with Expected Finite Horizon. | Krishnendu Chatterjee, Laurent Doyen |
| 2019 | Point-width and Max-CSPs. | Clment Carbonnel, Miguel Romero, Stanislav Zivn |
| 2019 | A short story of the CSP dichotomy conjecture. | Andrei A. Bulatov |
| 2019 | The Theory of Traces for Systems with Nondeterminism and Probability. | Filippo Bonchi, Ana Sokolova, Valeria Vignudelli |
| 2019 | Graphical Affine Algebra. | Filippo Bonchi, Robin Piedeleu, Pawel Sobocinski, Fabio Zanasi |
| 2019 | MSO+∇ is undecidable. | Mikolaj Bojanczyk, Edon Kelmendi, Michal Skrzypczak |
| 2019 | Topology is relevant (in a dichotomy conjecture for infinite-domain constraint satisfaction problems). | Manuel Bodirsky, Antoine Mottet, Miroslav Olsk, Jakub Oprsal, Michael Pinsker, Ross Willard |
| 2019 | Learning Concepts Definable in First-Order Logic with Counting. | Steffen van Bergerem |
| 2019 | Why Propositional Quantification Makes Modal Logics on Trees Robustly Hard? | Bartosz Bednarczyk, Stphane Demri |
| 2019 | Promises Make Finite (Constraint Satisfaction) Problems Infinitary. | Libor Barto |
| 2019 | When is Ontology-Mediated Querying Efficient? | Pablo Barcel, Cristina Feier, Carsten Lutz, Andreas Pieris |