Table of Contents

• Completing Gordon's Higher-Order LogicAndrei Popescu 0001. 1-15 [doi]
• Syntactic Effectful Realizability in Higher-Order LogicLiron Cohen 0001, Ariel Grunfeld, Dominik Kirst, Étienne Miquey. 16-30 [doi]
• #P is Sandwiched by One and Two #2DNF Calls: Is Subtraction Stronger Than We Thought?Max Bannach, Erik D. Demaine, Timothy Gomez, Markus Hecher. 31-43 [doi]
• Quantifier Elimination for Regular Integer Linear-Exponential ProgrammingMikhail R. Starchak. 44-56 [doi]
• Alternating Nominal Automata with Name AllocationFlorian Frank 0002, Daniel Hausmann 0001, Stefan Milius, Lutz Schröder, Henning Urbat. 57-70 [doi]
• Initial Algebra Correspondence under Reachability ConditionsMayuko Kori, Kazuki Watanabe 0003, Jurriaan Rot. 71-83 [doi]
• On the denotation of circular and non-wellfounded proofs in linear logic with fixed pointsThomas Ehrhard, Farzad Jafarrahmani, Alexis Saurin. 84-97 [doi]
• Closure and Complexity of Temporal CausalityMishel Carelli, Bernd Finkbeiner, Julian Siber. 98-111 [doi]
• The internal languages of univalent categoriesNiels van der Weide. 112-126 [doi]
• The Yoneda embedding in simplicial type theoryDaniel Gratzer, Jonathan Weinberger, Ulrik Buchholtz. 127-142 [doi]
• Hofmann-Streicher lifting of fibred categories : Dedicated to the memory of Thomas Streicher (1958-2025)Andrew Slattery, Jonathan Sterling. 143-154 [doi]
• Interpolation for the two-way modal μ-calculusJohannes Kloibhofer, Yde Venema. 155-168 [doi]
• Semantical Analysis of Intuitionistic Modal Logics between CK and IKJim de Groot, Ian Shillito, Ranald Clouston. 169-182 [doi]
• Proof Compression via Subatomic Logic and Guarded SubstitutionsVictoria Barrett, Alessio Guglielmi, Benjamin Ralph, Lutz Straßburger. 183-195 [doi]
• Substructural Abstract Syntax with Variable Binding and Single-Variable SubstitutionMarcelo Fiore, Sanjiv Ranchod. 196-208 [doi]
• Equivalence Hypergraphs: DPO Rewriting for Monoidal E-GraphsAleksei Tiurin, Chris Barrett, Dan R. Ghica, Nick Hu. 209-222 [doi]
• Homological Invariants of Higher-Order Equational TheoriesMirai Ikebuchi. 223-235 [doi]
• Group Order LogicAnatole Dahan. 236-248 [doi]
• The Identity Problem in virtually solvable matrix groups over algebraic numbersCorentin Bodart, Ruiwen Dong 0001. 249-261 [doi]
• Ordinal Exponentiation in Homotopy Type TheoryTom de Jong, Nicolai Kraus, Fredrik Nordvall Forsberg, Chuangjie Xu. 262-274 [doi]
• Naturality for higher-dimensional path typesThibaut Benjamin, Ioannis Markakis, Wilfred Offord, Chiara Sarti, Jamie Vicary. 275-288 [doi]
• The Steenrod squares via unordered joinsAxel Ljungström, David Wärn. 289-300 [doi]
• Model Enumeration of Two-Variable Logic with Quadratic Delay ComplexityQiaolan Meng, Juhua Pu, Hongting Niu, Yuyi Wang, Yuanhong Wang, Ondrej Kuzelka. 301-313 [doi]
• Navigational hierarchies of regular languagesThomas Place, Marc Zeitoun. 314-328 [doi]
• Separation and Definability in Fragments of Two-Variable First-Order Logic with CountingLouwe Kuijer, Tony Tan, Frank Wolter, Michael Zakharyaschev. 329-343 [doi]
• Characterization and Decidability of FC-Definable Regular LanguagesSam M. Thompson, Nicole Schweikardt, Dominik D. Freydenberger. 344-356 [doi]
• Algebraic and algorithmic synergies between promise and infinite-domain CSPsAntoine Mottet. 357-371 [doi]
• Classical Simulation of Quantum CSP StrategiesDemian Banakh, Lorenzo Ciardo, Marcin Kozik, Jan Tulowiecki. 372-388 [doi]
• Binary symmetries of tractable non-rigid structuresPaolo Marimon, Michael Pinsker. 389-402 [doi]
• The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problemsJohanna Brunar, Marcin Kozik, Tomás Nagy, Michael Pinsker. 403-416 [doi]
• Learning Weighted Automata over Number Rings, Concretely and CategoricallyQuentin Aristote, Sam van Gool, Daniela Petrisan, Mahsa Shirmohammadi. 417-430 [doi]
• Minimal History-Deterministic Co-Büchi Automata: Congruences and Passive LearningChristof Löding, Igor Walukiewicz. 431-443 [doi]
• Learning Deterministic One-Counter Automata in Polynomial TimePrince Mathew 0001, Vincent Penelle, A. V. Sreejith. 444-457 [doi]
• Risk-aware Markov Decision Processes Using Cumulative Prospect TheoryThomas Brihaye, Krishnendu Chatterjee, Stefanie Mohr, Maximilian Weininger. 458-471 [doi]
• Random Variables, Conditional Independence and Categories of Abstract Sample SpacesDario Stein. 472-484 [doi]
• Probabilistic Strategies: Definability and the Tensor Completeness ProblemNathan J. Bowler, Sergey Goncharov 0001, Paul Blain Levy. 485-498 [doi]
• Multiplicative Rewards in Markovian ModelsChristel Baier, Krishnendu Chatterjee, Tobias Meggendorfer, Jakob Piribauer. 499-512 [doi]
• The Qualitative Collapse of Concurrent GamesPierre Clairambault. 513-526 [doi]
• Reachability Types, Traces and Full AbstractionBenedict Bunting, Andrzej S. Murawski. 527-540 [doi]
• Effectful Mealy Machines: Bisimulation and TraceFilippo Bonchi, Elena Di Lavore, Mario Román. 541-554 [doi]
• Conformance Games for Graded SemanticsJonas Forster, Lutz Schröder, Paul Wild. 555-567 [doi]
• Stopping Criteria for Value Iteration on Concurrent Stochastic Reachability and Safety GamesMarta Grobelna, Jan Kretínský, Maximilian Weininger. 568-580 [doi]
• Reachability and Related Problems in Vector Addition Systems with Nested Zero TestsRoland Guttenberg, Wojciech Czerwinski, Slawomir Lasota 0001. 581-593 [doi]
• A Complexity Dichotomy for Semilinear Target Sets in Automata with One CounterYousef Shakiba, Henry Sinclair-Banks, Georg Zetzsche. 594-608 [doi]
• Functional Stream Semantics for a Synchronous Block-Diagram CompilerTimothy Bourke, Paul Jeanmaire, Marc Pouzet. 609-621 [doi]
• Pushdown Model Checking above the Cubic BottleneckA. R. Balasubramanian, Dmitry Chistikov 0001, Rupak Majumdar. 622-635 [doi]
• If At First You Don't Succeed: Extended Monitorability through Multiple ExecutionsAntonis Achilleos, Adrian Francalanza, Jasmine Xuereb. 636-650 [doi]
• Multiple Reachability in Linear Dynamical SystemsToghrul Karimov, Edon Kelmendi, Joël Ouaknine, James Worrell 0001. 651-663 [doi]
• Approximate Evaluation of Quantitative Second Order QueriesJan Dreier, Robert Ganian, Thekla Hamm. 664-677 [doi]
• Recognisability Equals Definability for Finitely Representable Matroids of Bounded Path-WidthRutger Campbell, Bruno Guillon, Mamadou Moustapha Kanté, Eun Jung Kim 0002, Sang-il Oum. 678-690 [doi]
• Graphs of unbounded linear cliquewidth must transduce all treesMikolaj Bojanczyk, Pierre Ohlmann. 691-703 [doi]
• Regular Grammars for Sets of Graphs of Tree-Width 2Marius Bozga, Radu Iosif, Florian Zuleger. 704-717 [doi]
• When is the partial map classifier a Sierpiński cone?Leoni Pugh, Jonathan Sterling. 718-731 [doi]
• Logical relations for call-by-push-value models, via internal fibrations in a 2-categoryPedro H. Azevedo de Amorim, Satoshi Kura 0003, Philip Saville. 732-747 [doi]
• Compositional Taylor expansion in cartesian differential categoriesAymeric Walch. 748-760 [doi]
• Thin Coalgebraic Behaviours Are InductiveAnton Chernev, Corina Cîrstea, Helle Hvid Hansen, Clemens Kupke. 761-775 [doi]
• Relators and Notions of Simulation RevisitedSergey Goncharov 0001, Dirk Hofmann, Pedro Nora, Lutz Schröder, Paul Wild. 776-789 [doi]
• Behavioural Conformances based on Lax CouplingsPaul Wild, Lutz Schröder. 790-803 [doi]
• The commutativity problem for effective varieties of formal series, and applicationsLorenzo Clemente. 804-817 [doi]
• Convergence Laws for Extensions of First-Order Logic with AveragingSam Adam-Day, Michael Benedikt, Alberto Larrauri. 818-830 [doi]
• 3D-grids are not transducible from planar graphsJakub Gajarský, Michal Pilipczuk, Filip Pokrývka. 831-842 [doi]
• Transductions of Graph Classes Admitting Product StructurePetr Hlinený, Jan Jedelský. 843-855 [doi]
• Flipping and ForkingWojciech Przybyszewski, Szymon Torunczyk. 856-869 [doi]
• Operator Spaces, Linear Logic and the Heisenberg-Schrödinger Duality of Quantum TheoryBert Lindenhovius, Vladimir Zamdzhiev. 870-883 [doi]
• Complete Quantum Relational Hoare Logics from Optimal Transport DualityGilles Barthe, Minbo Gao, Theo Wang, Li Zhou 0013. 884-925 [doi]
• The Blurred Drinker Paradox: Constructive Reverse Mathematics of the Downward Löwenheim-Skolem TheoremDominik Kirst, Haoyi Zeng. 926-940 [doi]