Table of Contents

• A Rewriting Theory for Quantum λ-CalculusClaudia Faggian, Gaetan Lopez, Benoît Valiron. [doi]
• Reachability for Multi-Priced Timed Automata with Positive and Negative RatesAndrew Scoones, Mahsa Shirmohammadi, James Worrell 0001. [doi]
• Completeness of First-Order Bi-Intuitionistic LogicDominik Kirst, Ian Shillito. [doi]
• A Complete Graphical Language for Linear Optical Circuits with Finite-Photon-Number Sources and DetectorsNicolas Heurtel. [doi]
• Simple Types for Probabilistic TerminationWillem Heijltjes, Georgina Majury. [doi]
• Playing with Modalities (Invited Talk)Elaine Pimentel, Carlos Olarte, Timo Lang, Robert Freiman, Christian G. Fermüller. [doi]
• Taking Bi-Intuitionistic Logic First-Order: A Proof-Theoretic Investigation via Polytree SequentsTim S. Lyon, Ian Shillito, Alwen Tiu. [doi]
• The Algebras for Automatic RelationsRémi Morvan. [doi]
• Extension Preservation on Dense Graph ClassesIoannis Eleftheriadis. [doi]
• On the Expansion of Monadic Second-Order Logic with Cantor-Bendixson Rank and Order Type PredicatesThomas Colcombet, Alexander Rabinovich. [doi]
• Finite Relational Semantics for Language Kleene Algebra with ComplementYoshiki Nakamura 0001. [doi]
• Boundedness of Cost Register Automata over the Integer Min-Plus SemiringAndrei Draghici, Radoslaw Piórkowski, Andrew Ryzhikov. [doi]
• Coslice Colimits in Homotopy Type TheoryPerry Hart, Kuen-Bang Hou (Favonia). [doi]
• Two-Way One-Counter Nets RevisitedShaull Almagor, Michaël Cadilhac, Asaf Yeshurun. [doi]
• First-Order Logic with Equicardinality in Random GraphsSimi Haber, Tal Hershko, Mostafa Mirabi, Saharon Shelah. [doi]
• A Complete Diagrammatic Calculus for Automata SimulationThibaut Antoine, Robin Piedeleu, Alexandra Silva 0001, Fabio Zanasi. [doi]
• The Complexity of Second-Order HyperLTLHadar Frenkel, Martin Zimmermann 0002. [doi]
• On the VC Dimension of First-Order Logic with Counting and Weight AggregationSteffen van Bergerem, Nicole Schweikardt. [doi]
• A Mixed Linear and Graded Logic: Proofs, Terms, and ModelsVictoria Vollmer, Danielle Marshall 0001, Harley Eades III, Dominic Orchard. [doi]
• A Strictly Linear Subatomic Proof SystemVictoria Barrett, Alessio Guglielmi, Benjamin Ralph. [doi]
• Permissive Equilibria in Multiplayer Reachability GamesAline Goeminne, Benjamin Monmege. [doi]
• Insights from Univalent Foundations: A Case Study Using Double CategoriesNima Rasekh, Niels van der Weide, Benedikt Ahrens, Paige Randall North. [doi]
• Propositional Logics of Overwhelming TruthThibaut Antoine, David Baelde. [doi]
• Front Matter, Table of Contents, Preface, Conference Organization [doi]
• Strong Induction Is an Up-To TechniqueFilippo Bonchi, Elena Di Lavore, Anna Ricci. [doi]
• Undefinability of Approximation of 2-To-2 GamesAnuj Dawar, Bálint Molnár. [doi]
• Finite Variable Counting Logics with Restricted RequantificationSimon Raßmann, Georg Schindling, Pascal Schweitzer. [doi]
• Synthetic Mathematics for the Mechanisation of Computability Theory and Logic (Invited Talk)Yannick Forster 0002. [doi]
• On the Probabilistic and Statistical Verification of Infinite Markov Chains (Invited Talk)Patricia Bouyer. [doi]
• Equi-Rank Homomorphism Preservation Theorem on Finite StructuresBenjamin Rossman. [doi]
• Computational Complexity of the Weisfeiler-Leman DimensionMoritz Lichter, Simon Raßmann, Pascal Schweitzer. [doi]
• A Complete Inference System for Probabilistic Infinite Trace EquivalenceCorina Cîrstea, Lawrence S. Moss, Victoria Noquez, Todd Schmid, Alexandra Silva 0001, Ana Sokolova. [doi]
• The Ackermann Award 2024Maribel Fernández, Prakash Panangaden. [doi]
• Correspondences Between Codensity and Coupling-Based Liftings, a Practical ApproachSamuel Humeau 0002, Daniela Petrisan, Jurriaan Rot. [doi]
• Description Complexity of Unary Structures in First-Order Logic with Links to EntropyReijo Jaakkola, Antti Kuusisto, Miikka Vilander. [doi]
• A Kleene Algebra with Tests for Union Bound Reasoning About Probabilistic ProgramsLeandro Gomes 0001, Patrick Baillot, Marco Gaboardi. [doi]
• On the Minimisation of Deterministic and History-Deterministic Generalised (Co)Büchi AutomataAntonio Casares, Olivier Idir, Denis Kuperberg, Corto Mascle, Aditya Prakash 0002. [doi]
• The Parameterized Complexity of Learning Monadic Second-Order LogicSteffen van Bergerem, Martin Grohe, Nina Runde. [doi]
• On Homogeneous Models of Fluted LanguagesDaumantas Kojelis. [doi]
• Unifying Sequent Systems for Gödel-Löb Provability Logic via Syntactic TransformationsTim S. Lyon. [doi]
• Linear Realisability over Nets: MultiplicativesAdrien Ragot, Thomas Seiller, Lorenzo Tortora de Falco. [doi]
• Kleene Algebra with Commutativity Conditions Is UndecidableArthur Azevedo de Amorim, Cheng Zhang, Marco Gaboardi. [doi]
• The Complexity of Deciding Characteristic Formulae in Van Glabbeek's Branching-Time SpectrumLuca Aceto, Antonis Achilleos, Aggeliki Chalki, Anna Ingólfsdóttir. [doi]
• Quantitative Graded Semantics and Spectra of Behavioural MetricsJonas Forster, Lutz Schröder, Paul Wild, Harsh Beohar, Sebastian Gurke, Barbara König 0001, Karla Messing. [doi]
• Minimality in Finite-Dimensional ZW-CalculiMarc de Visme, Renaud Vilmart. [doi]
• Modal Automata: Analysing Modal Fixpoint Logics, One Step at a Time (Invited Talk)Yde Venema. [doi]
• Exponential Lower Bounds on Definable Fixed PointsKonstantinos Papafilippou, David Fernández Duque. [doi]
• Classical Linear Logic in Perfect Banach LatticesPedro H. Azevedo de Amorim, Leon Witzman, Dexter Kozen. [doi]
• The Lambda Calculus Is QuantifiableValentin Maestracci, Paolo Pistone. [doi]
• Quantum and Classical Markovian Graphical Causal Models and Their IdentificationJonathan Barrett, Isaac Friend, Aleks Kissinger. [doi]