| 0 | -- | 0 | Benedikt Ahrens. Initial Semantics for Reduction Rules |
| 0 | -- | 0 | Benedetto Intrigila, Giulio Manzonetto, Andrew Polonsky. Degrees of extensionality in the theory of Böhm trees and Sallé's conjecture |
| 0 | -- | 0 | Lorenzo Clemente, Richard Mayr. Efficient reduction of nondeterministic automata with application to language inclusion testing |
| 0 | -- | 0 | Andrei Bulatov, Peter Mayr, Ágnes Szendrei. The Subpower Membership Problem for Finite Algebras with Cube Terms |
| 0 | -- | 0 | Michele Boreale. Algebra, coalgebra, and minimization in polynomial differential equations |
| 0 | -- | 0 | Willem Conradie, Alessandra Palmigiano, Zhiguang Zhao. Sahlqvist via Translation |
| 0 | -- | 0 | Annabelle McIver, Carroll Morgan, Tahiry M. Rabehaja. Abstract Hidden Markov Models: a monadic account of quantitative information flow |
| 0 | -- | 0 | Sebastian Enqvist, Yde Venema. Disjunctive bases: normal forms and model theory for modal logics |
| 0 | -- | 0 | Francesco Dagnino. Coaxioms: flexible coinductive definitions by inference systems |
| 0 | -- | 0 | Kazuyuki Asada, Naoki Kobayashi 0001, Ryoma Sin'ya, Takeshi Tsukada. Almost Every Simply Typed Lambda-Term Has a Long Beta-Reduction Sequence |
| 0 | -- | 0 | Albert Atserias, José L. Balcázar, Marie Ely Piceno. Relative Entailment Among Probabilistic Implications |
| 0 | -- | 0 | David Reutter, Jamie Vicary. A classical groupoid model for quantum networks |
| 0 | -- | 0 | Dmitry Chistikov, Wojciech Czerwinski, Piotr Hofman, Michal Pilipczuk, Michael Wehar. Shortest paths in one-counter systems |
| 0 | -- | 0 | Erich Grädel, Martin Grohe, Benedikt Pago, Wied Pakusa. A Finite-Model-Theoretic View on Propositional Proof Complexity |
| 0 | -- | 0 | Tomasz Brengos, Marco Peressotti. Behavioural equivalences for timed systems |
| 0 | -- | 0 | Alan Jeffrey, James Riely. On Thin Air Reads: Towards an Event Structures Model of Relaxed Memory |
| 0 | -- | 0 | Thomas Ehrhard, Christine Tasson. Probabilistic call by push value |
| 0 | -- | 0 | Benedikt Ahrens, Peter LeFanu Lumsdaine. Displayed Categories |
| 0 | -- | 0 | Pablo Cañones, Boris Köpf, Jan Reineke. On the Incomparability of Cache Algorithms in Terms of Timing Leakage |
| 0 | -- | 0 | Oleg Verbitsky, Maksim Zhukovskii. On the First-Order Complexity of Induced Subgraph Isomorphism |
| 0 | -- | 0 | Dariusz Biernacki, Sergueï Lenglet, Piotr Polesiuk. Proving Soundness of Extensional Normal-Form Bisimilarities |
| 0 | -- | 0 | Ian Orton, Andrew M. Pitts. Models of Type Theory Based on Moore Paths |
| 0 | -- | 0 | Adriana Balan, Alexander Kurz 0001, Jiri Velebil. Extending set functors to generalised metric spaces |
| 0 | -- | 0 | Noam Zeilberger. A sequent calculus for a semi-associative law |
| 0 | -- | 0 | Paula Severi. A Light Modality for Recursion |
| 0 | -- | 0 | Dexter Kozen. Natural Transformations as Rewrite Rules and Monad Composition |
| 0 | -- | 0 | Dimiter Skordev. Moschovakis Extension of Represented Spaces |
| 0 | -- | 0 | Simon Castellan, Pierre Clairambault, Glynn Winskel. Thin Games with Symmetry and Concurrent Hyland-Ong Games |
| 0 | -- | 0 | Predrag Janicic, Filip Maric, Marko Malikovic. Computer-Assisted Proving of Combinatorial Conjectures Over Finite Domains: A Case Study of a Chess Conjecture |
| 0 | -- | 0 | Robert Ganian, Petr Hlinený, Jaroslav Nesetril, Jan Obdrzálek, Patrice Ossona de Mendez. Shrub-depth: Capturing Height of Dense Graphs |
| 0 | -- | 0 | Olaf Beyersdorff, Joshua Blinkhorn, Luke Hinde. Size, Cost, and Capacity: A Semantic Technique for Hard Random QBFs |
| 0 | -- | 0 | Berit Grußien. Capturing Polynomial Time using Modular Decomposition |
| 0 | -- | 0 | Hadrian Andradi, Weng Kin Ho. Topological Scott Convergence Theorem |
| 0 | -- | 0 | Marcel Erné. Web spaces and worldwide web spaces: topological aspects of domain theory |
| 0 | -- | 0 | Simon Docherty, David J. Pym. Stone-Type Dualities for Separation Logics |
| 0 | -- | 0 | Tatsuji Kawai, Giovanni Sambin. The principle of pointfree continuity |