Yoshiki Nakamura. Finite Relational Semantics for Language Kleene Algebra with Complement
Nicolas Heurtel. A Complete Graphical Language for Linear Optical Circuits with Finite-Photon-Number Sources and Detectors
Aggeliki Chalki, Luca Aceto, Anna Ingolfsdottir and Antonis Achilleos. The complexity of deciding characteristic formulae in van Glabbeek’s branching-time spectrum
Thomas Colcombet and Alexander Rabinovich. On the expansion of monadic second-order logic with Cantor-Bendixson rank and order type predicates
Steffen van Bergerem, Martin Grohe and Nina Runde. The Parameterized Complexity of Learning Monadic Second-Order Logic
Moritz Lichter, Simon Raßmann and Pascal Schweitzer. Computational complexity of the Weisfeiler-Leman dimension
Adrien Ragot, Lorenzo Tortora de Falco and Thomas Seiller. Linear Realisability over nets: multiplicatives
Tim Lyon, Ian Shillito and Alwen Tiu. Taking Bi-Intuitionistic Logic First-Order: A Proof-Theoretic Investigation via Polytree Sequents
Hadar Frenkel and Martin Zimmermann. The Complexity of Second-order HyperLTL
Simon Raßmann, Georg Schindling and Pascal Schweitzer. Finite Variable Counting Logics with Restricted Requantification
Filippo Bonchi, Elena Di Lavore and Anna Ricci. Strong Induction is an up-to technique
Jonas Forster, Lutz Schröder, Paul Wild, Harsh Beohar, Sebastian Gurke, Barbara König and Karla Messing. Quantitative Graded Semantics and Spectra of Behavioural Metrics
Pedro H. Azevedo de Amorim, Leon Witzman and Dexter Kozen. Classical Linear Logic in Perfect Banach Lattices
Andrei Draghici, Radosław Piórkowski and Andrew Ryzhikov. Boundedness of cost register automata over the integer min-plus semiring
Jonathan Barrett, Isaac Friend and Aleks Kissinger. Quantum and classical Markovian graphical causal models and their identification
Valentin Maestracci and Paolo Pistone. The Lambda Calculus is Quantifiable
Reijo Jaakkola, Antti Kuusisto and Miikka Vilander. Description Complexity of Unary Structures in First-Order Logic with Links to Entropy
Konstantinos Papafilippou and David Fernández. Exponential Lower Bounds on Definable Fixed Points
Leandro Gomes, Patrick Baillot and Marco Gaboardi. A Kleene algebra with tests for union bound reasoning about probabilistic programs
Simi Haber, Tal Hershko, Mostafa Mirabi and Saharon Shelah. First order logic with equicardinality in random graphs
Willem Heijltjes and Georgina Majury. Simple types for probabilistic termination
Rémi Morvan. The Algebras for Automatic Relations
Thibaut Antoine, Robin Piedeleu, Alexandra Silva and Fabio Zanasi. A Complete Diagrammatic Calculus for Automata Simulation
Steffen van Bergerem and Nicole Schweikardt. On the VC Dimension of First-Order Logic with Counting and Weight Aggregation
Aline Goeminne and Benjamin Monmege. Permissive Equilibria in Multiplayer Reachability Games
Victoria Barrett, Alessio Guglielmi and Benjamin Ralph. A strictly linear subatomic proof system
Tim Lyon. Unifying Structural and Cyclic Sequent Systems for Gödel-Löb Logic via Syntactic Transformations
Anuj Dawar and Bálint Molnár. Undefinability of Approximation of 2-to-2 Games
Victoria Vollmer, Danielle Marshall, Harley Eades Iii and Dominic Orchard. A Mixed Linear and Graded Logic: Proofs, Terms, and Models
Nima Rasekh, Niels van der Weide, Benedikt Ahrens and Paige Randall North. Insights From Univalent Foundations: A Case Study Using Double Categories
Andrew Scoones, Mahsa Shirmohammadi and James Worrell. Reachability for Multi-Priced Timed Automata with Positive and Negative Rates
Perry Hart and Kuen-Bang Hou Favonia. Colimits in Homotopy Type Theory
Marc de Visme and Renaud Vilmart. Minimality in Finite-Dimensional ZW-Calculi
Benjamin Rossman. Equi-rank Homomorphism Preservation Theorem on Finite Structures
Antonio Casares, Olivier Idir, Denis Kuperberg, Corto Mascle and Aditya Prakash. On the Minimisation of Deterministic and History-Deterministic Generalised (co)Büchi Automata
Ian Shillito and Dominik Kirst. Completeness of First-Order Bi-intuitionistic Logic
Daumantas Kojelis. On Homogenous Models of Fluted Languages
Thibaut Antoine and David Baelde. Propositional Logics of Overwhelming Truth
Arthur Azevedo de Amorim, Cheng Zhang and Marco Gaboardi. Kleene algebra with commutativity conditions is undecidable
Samuel Humeau, Daniela Petrisan and Jurriaan Rot. Correspondences between codensity and coupling-based liftings, a practical approach
Corina Cirstea, Lawrence Moss, Victoria Noquez, Todd Schmid, Alexandra Silva and Ana Sokolova. A Complete Inference System for Probabilistic Infinite Trace Equivalence
Ioannis Eleftheriadis. Extension preservation on dense graph classes
Shaull Almagor, Michaël Cadilhac and Asaf Yeshurun. Two-Way One-Counter Nets Revisited
Claudia Faggian, Gaetan Lopez and Benoît Valiron. A rewriting theory for quantum lambda-calculus