| 2023 | Completeness of Sum-Over-Paths for Toffoli-Hadamard and the Dyadic Fragments of Quantum Computation. | Renaud Vilmart |
| 2023 | Dynamic Complexity of Regular Languages: Big Changes, Small Work. | Felix Tschirbs, Nils Vortmeier, Thomas Zeume |
| 2023 | Tower-Complete Problems in Contraction-Free Substructural Logics. | Hiromi Tanaka |
| 2023 | Parity Games of Bounded Tree-Depth. | Konrad Staniszewski |
| 2023 | Enhanced Induction in Behavioural Relations (Invited Talk). | Davide Sangiorgi |
| 2023 | Adding Transitivity and Counting to the Fluted Fragment. | Ian Pratt-Hartmann, Lidia Tendera |
| 2023 | Finite Model Theory and Proof Complexity Revisited: Distinguishing Graphs in Choiceless Polynomial Time and the Extended Polynomial Calculus. | Benedikt Pago |
| 2023 | Open Higher-Order Logic. | Ugo Dal Lago, Francesco Gavazzo, Alexis Ghyselen |
| 2023 | Frobenius Structures in Star-Autonomous Categories. | Cdric de Lacroix, Luigi Santocanale |
| 2023 | Gdel's Theorem Without Tears - Essential Incompleteness in Synthetic Computability. | Dominik Kirst, Benjamin Peters |
| 2023 | Complexity Classifications via Algebraic Logic. | Reijo Jaakkola, Antti Kuusisto |
| 2023 | Complexity of Polyadic Boolean Modal Logics: Model Checking and Satisfiability. | Reijo Jaakkola |
| 2023 | The Expressive Power of CSP-Quantifiers. | Lauri Hella |
| 2023 | Explorable Automata. | Emile Hazard, Denis Kuperberg |
| 2023 | Order-Invariance in the Two-Variable Fragment of First-Order Logic. | Julien Grange |
| 2023 | Inductive Inference and Epistemic Modal Logic (Invited Talk). | Nina Gierasimczuk |
| 2023 | Quantitative Hennessy-Milner Theorems via Notions of Density. | Jonas Forster, Sergey Goncharov, Dirk Hofmann, Pedro Nora, Lutz Schrder, Paul Wild |
| 2023 | A Normalized Edit Distance on Infinite Words. | Dana Fisman, Joshua Grogin, Gera Weiss |
| 2023 | Translating Proofs from an Impredicative Type System to a Predicative One. | Thiago Felicissimo, Frdric Blanqui, Ashish Kumar Barnawal |
| 2023 | Asymptotic Rewriting (Invited Talk). | Claudia Faggian |
| 2023 | Non-Uniform Complexity via Non-Wellfounded Proofs. | Gianluca Curzi, Anupam Das |
| 2023 | Measure-Theoretic Semantics for Quantitative Parity Automata. | Corina Crstea, Clemens Kupke |
| 2023 | A Curry-Howard Correspondence for Linear, Reversible Computation. | Kostia Chardonnet, Alexis Saurin, Benot Valiron |
| 2023 | Hennessy-Milner Theorems via Galois Connections. | Harsh Beohar, Sebastian Gurke, Barbara Knig, Karla Messing |
| 2023 | Degree Spectra, and Relative Acceptability of Notations. | Nikolay Bazhenov, Dariusz Kalocinski |