- Cyril Banderier and Massimiliano Goldwurm. Number of prefixes in trace monoids: clique polynomials and dependency graphs
- Nikolay Bazhenov and Stefan Vatev. A Note on Computable Embeddings for Ordinals and Their Reverses
- Ulrich Berger, Olga Petrovska and Hideki Tsuiki. Prawf: An interactive proof system for Program extraction
- Antonio Boccuto and Arturo Carpi. Repetitions in Toeplitz words and the Thue threshold
- Manuel Bodirsky, Simon Knäuer and Florian Starke. ASNP: a tame fragment of existential second-order logic
- Matthew de Brecht. Some notes on spaces of ideals and computable topology
- Florian Bridoux, Maximilien Gadouleau and Guillaume Theyssier. On simulation in automata networks
- Merlin Carl. Clockability for Ordinal Turing Machines
- David Fernández-Duque and Andreas Weiermann. Ackermannian Goodstein sequences of intermediate growth
- Makoto Fujiwara. Parallelizations in Weihrauch reducibility and constructive reverse mathematics
- Zuzana Haniková. On the complexity of validity degrees in Łukasiewicz logic
- Sune Kristian Jakobsen and Jakob Grue Simonsen. Liouville Numbers and the Computational Complexity of Changing Bases
- Lars Kristiansen and Jakob Grue Simonsen. On the Complexity of Conversion between Classic Real Number Representations
- Lars Kristiansen and Juvenal Murwanashyaka. On Interpretability between some weak essential undecidable theories
- Martin Kutrib, Andreas Malcher, Carlo Mereghetti and Beatrice Palano. Deterministic and Nondeterministic Iterated Uniform Finite-State Transducers: Computational and Descriptional Power
- Stephane Le Roux. Time-aware uniformization of winning strategies
- Russell Miller. Non-coding enumeration operators
- Kévin Perrot, Sylvain Sené and Lucas Venturini. #P-completeness of counting update digraphs, cacti, and series-parallel decomposition method
- Iosif Petrakis. Functions of Baire class one over a Bishop topology
- Nicola Prezza and Giovanna Rosone. Faster Online Computation of the Succinct Longest Previous Factor Array
- Simone Rinaldi, Giulia Palma and Andrea Frosini. Combinatorial properties of degree sequences of 3-uniform hypergraphs arising from saind sequences
- Peter Schuster and Daniel Wessel. The Computational Significance of Hausdorff’s Maximal Chain Principle
- Martin Vu and Henning Fernau. Insertion-Deletion Systems With Substitutions I
Informal presentations
- Antonin Callard and Mathieu Hoyrup. Descriptive complexity on non-Polish spaces.
- Vittorio Cipriani. Learning algebraic structures bounding the number of mistakes.
- Tonicha Crook. The Weihrauch degree of finding Nash Equilibria in multiplayer games.
- Valentino Delle Rose. Word Problem and Ceers.
- Michał Tomasz Godziszewski and Luca San Mauro. Quotient structures, philosophy of computability theory and computational structuralism.
- Ivan Adrian Koswara, Gleb Pogudin, Svetlana Selivanova and Martin Ziegler. Complexity of Linear PDEs: Iterative vs. Analytic Series Approach
- Patrick Lutz and Benjamin Siskind. Part 1 of Martin’s Conjecture for Order Preserving Functions.
- Janos Makowsky. Congruences for Combinatorial Counting Functions.
- Sarah Reitzes, Damir Dzhafarov and Denis Hirschfeldt. Reduction games, provability, and compactness.
- Sam Sanders. On the logical and computational properties of the uncountable.
- Alberto Termine and Giuseppe Primiero. Computational Logic for Uncertain Reasoning on Stochastic Systems.
- Manlio Valenti. Finding descending sequences in ill-founded linear orders.
- James Walsh and Patrick Lutz. Incompleteness and jump hierarchies.
- Andreas Weiermann. Goodstein principles and notation systems for natural numbers.
- Linda Westrick. The recursion theorem in the Weihrauch lattice.
