Table of Contents

• The Ackermann Award 2025Maribel Fernández, Prakash Panangaden. [doi]
• Cyclic Proof Theory of Generalised Inductive DefinitionsGianluca Curzi, Lukas Melgaard. [doi]
• Weakly-Sparse and Strongly Flip-Flat Classes of Graphs Are Uniformly Almost-WideFatemeh Ghasemi, Julien Grange, Mamadou Moustapha Kanté, Florent R. Madelaine. [doi]
• Disjunctions of Two Dependence AtomsNicolas Fröhlich 0001, Phokion G. Kolaitis, Arne Meier. [doi]
• A Unifying Conservation TheoremGiulio Fellin. [doi]
• Reasoning About Quality in HyperpropertiesSamuel Graepler, Benjamin Monmege, Jean-Marc Talbot. [doi]
• Analysis of Logics with ArithmeticMichael Benedikt, Chia-Hsuan Lu, Tony Tan. [doi]
• Kamp Theorem for Pomset Languages of Higher Dimensional AutomataEmily Clement, Enzo Erlich, Jérémy Ledent. [doi]
• Towards the Type Safety of Pure Subtype SystemsValentin Pasquale, Álvaro García-Pérez. [doi]
• Reward Interfaces with Best-Effort ImplementationsRafael Dewes, Rayna Dimitrova. [doi]
• Lax Modal Lambda CalculiNachiappan Valliappan. [doi]
• The Groupoid-Syntax of Type Theory Is a SetThorsten Altenkirch, Ambrus Kaposi, Szumi Xie. [doi]
• Minimal DFAs Witnessing Language InequivalenceJan Martens 0001. [doi]
• String Diagrams for Closed Symmetric Monoidal CategoriesCallum Reader, Alessandro Di Giorgio 0002. [doi]
• A Logic for Fresh Labelled Transition SystemsMohamed H. Bandukara, Nikos Tzevelekos. [doi]
• Satisfiability in Łukasiewicz Logic and Its Unbounded RelativeZuzana Haniková, Filip Jankovec. [doi]
• Rational Lawvere Logic (Invited Paper)Giorgio Bacci, Radu Mardare, Prakash Panangaden, Gordon D. Plotkin. [doi]
• On the Algorithmic Structure of Dialectica RealisersDavide Barbarossa, Thomas Powell 0001. [doi]
• Bridging Weighted First Order Model Counting and Graph PolynomialsQipeng Kuang, Ondrej Kuzelka, Yuanhong Wang, Yuyi Wang 0001. [doi]
• Register-Bounded Synthesis from Constraint LTLNino Dauvier, Emmanuel Filiot, Pierre-Alain Reynier. [doi]
• The Biequivalence of Path Categories and Axiomatic Martin-Löf Type TheoriesDaniël Otten, Matteo Spadetto. [doi]
• A Uniform Cut-Elimination Theorem for Linear Logics with Fixed Points and Super ExponentialsAlexis Saurin, Esaïe Bauer. [doi]
• Mean-Payoff and Energy Discrete-Bidding GamesGuy Avni, Suman Sadhukhan. [doi]
• Robustness of Constraint Automata for Description Logics with Concrete DomainsStéphane Demri, Tianwen Gu. [doi]
• Automata and Algebras for Probability and Nondeterminism (Invited Talk)Ana Sokolova. [doi]
• Memory Requirements in Non-Zero-Sum GamesYoav Feinstein, Orna Kupferman. [doi]
• Front Matter, Table of Contents, Preface, Conference Organization [doi]
• Parametric Iteration in Resource TheoriesAlessandro Di Giorgio 0002, Pawel Sobocinski 0001, Niels F. W. Voorneveld. [doi]
• Constructing Witnesses for Lower Bounds on Behavioural DistancesRuben Turkenburg, Harsh Beohar, Franck van Breugel, Clemens Kupke, Jurriaan Rot. [doi]
• Boolean Basis and Succinctness of Modal Logic via Hella-Vilander GamesSebastian Pfau. [doi]
• Useful Call-by-Value: A Semantic Interpretation via Quantitative TypesPablo Barenbaum, Delia Kesner, Mariana Milicich. [doi]
• On the Entailment Problem in Dynamic Separation Logic with Inductive DefinitionsNicolas Peltier. [doi]
• Interpreting Lambda Calculus in Domain-Valued Random VariablesRobert Furber, Radu Mardare, Prakash Panangaden, Dana S. Scott. [doi]
• Compactness in Semiring SemanticsSophie Brinke, Anuj Dawar, Erich Grädel, Lovro Mrkonjic, Matthias Naaf. [doi]
• Deciding the Value of Two-Clock Almost Non-Zeno Weighted Timed GamesIsa Vialard. [doi]
• Well-Founded Coalgebras Meet Kőnig's LemmaHenning Urbat, Thorsten Wißmann. [doi]
• Resourceful Traces for Commuting ProcessesMatthew Earnshaw, Chad Nester, Mario Román. [doi]
• Arity Hierarchies for Quantifiers Closed Under Partial PolymorphismsAnuj Dawar, Lauri Hella, Benedikt Pago. [doi]
• Towards A Rosetta Stone of Interactive and Quantitative Semantics (Invited Talk)Pierre Clairambault. [doi]
• ε-Distance via Lévy-Prokhorov LiftingJosée Desharnais, Ana Sokolova. [doi]
• A Complete Diagrammatic Calculus for Conditional Gaussian MixturesMateo Torres-Ruiz, Robin Piedeleu, Alexandra Silva 0001, Fabio Zanasi. [doi]
• The Logic Behind Colour Refinement (Invited Talk)Sandra Kiefer. [doi]
• Hereditary First-Order Logic: the Tractable Quantifier Prefix ClassesManuel Bodirsky, Santiago Guzmán-Pro. [doi]
• Classifying Covering Types in Homotopy Type TheorySamuel Mimram, Émile Oleon. [doi]
• A Modular Framework for Proof-Search via Formalised Modal Completeness in HOL LightAntonella Bilotta, Marco Maggesi, Cosimo Perini Brogi. [doi]
• A Game for Counting Logic Formula Size and an Application to Linear OrdersGregoire Fournier, György Turán. [doi]
• On Left Adjoints Preserving Colimits in HoTTPerry Hart. [doi]
• Parametric Disjunctive Timed NetworksÉtienne André, Swen Jacobs, Engel Lefaucheux. [doi]
• A Canonical Form for Universe Levels in Impredicative Type TheoryYoan Géran. [doi]