Table of Contents

• Minimal Equational Theories for Quantum CircuitsAlexandre Clément, Noé Delorme, Simon Perdrix. [doi]
• Equivariant ideals of polynomialsArka Ghosh 0002, Slawomir Lasota 0001. [doi]
• Diagrammatic Algebra of First Order LogicFilippo Bonchi, Alessandro Di Giorgio 0002, Nathan Haydon, Pawel Sobocinski 0001. [doi]
• Complete Game Logic with SabotageNoah Abou El Wafa, André Platzer. [doi]
• Soundness of reset workflow netsMichael Blondin, Alain Finkel, Piotr Hofman, Filip Mazowiecki, Philip Offtermatt. [doi]
• On the Decidability of Monadic Second-Order Logic with Arithmetic PredicatesValérie Berthé, Toghrul Karimov, Joris Nieuwveld, Joël Ouaknine, Mihir Vahanwala, James Worrell 0001. [doi]
• "Upon This Quote I Will Build My Church Thesis"Pierre-Marie Pédrot. [doi]
• A Completeness Theorem for Probabilistic Regular ExpressionsWojciech Rozowski, Alexandra Silva. [doi]
• On the complexity of Maslov's class K̅Oskar Fiuk, Emanuel Kieronski, Vincent Michielini. [doi]
• Equivalence and Conditional Independence in Atomic Sheaf LogicAlex Simpson. [doi]
• Defining algorithmically presented structures in first order logicNadim Kasymov, Nadira Karimova, Bakh Khoussainov. [doi]
• Uniformisation of Regular Relations in First-Order Logic with Two VariablesNathan Lhote, Vincent Michielini, Michal Skrzypczak. [doi]
• δ is for DialecticaMarie Morgane Kerjean, Pierre-Marie Pédrot. [doi]
• Linear Termination is UndecidableFabian Mitterwallner, Aart Middeldorp, René Thiemann. [doi]
• An expressively complete local past propositional dynamic logic over Mazurkiewicz traces and its applicationsBharat Adsul, Paul Gastin, Shantanu Kulkarni, Pascal Weil. [doi]
• 1-in-3 vs. Not-All-Equal: Dichotomy of a broken promiseLorenzo Ciardo, Marcin Kozik, Andrei A. Krokhin, Tamio-Vesa Nakajima, Stanislav Zivný. [doi]
• Composing Codensity BisimulationsMayuko Kori, Kazuki Watanabe 0003, Jurriaan Rot, Shin-ya Katsumata. [doi]
• Algebraic Approach to ApproximationLibor Barto, Silvia Butti, Alexandr Kazda, Caterina Viola, Stanislav Zivný. [doi]
• On the Separability Problem of VASS Reachability LanguagesEren Keskin, Roland Meyer 0001. [doi]
• Contextual Equivalence for State and Control via Nested DataBenedict Bunting, Andrzej S. Murawski. [doi]
• An Analysis of Symmetry in Quantitative SemanticsPierre Clairambault, Simon Forest. [doi]
• Delooping cyclic groups with lens spaces in homotopy type theorySamuel Mimram, Émile Oleon. [doi]
• First order complexity of finite random structuresDanila Demin, Maksim Zhukovskii. [doi]
• A Cartesian Closed Category for Random VariablesPietro Di Gianantonio, Abbas Edalat. [doi]
• Separation and Encodability in Mixed Choice Multiparty SessionsKirstin Peters, Nobuko Yoshida. [doi]
• Deterministic Sub-exponential Algorithm for Discounted-sum Games with Unary WeightsAli Asadi, Krishnendu Chatterjee, Jakub Svoboda, Raimundo Saona Urmeneta. [doi]
• Model Checking Disjoint-Paths Logic on Topological-Minor-Free Graph ClassesNicole Schirrmacher, Sebastian Siebertz, Giannos Stamoulis, Dimitrios M. Thilikos, Alexandre Vigny. [doi]
• On the Completeness of Interpolation AlgorithmsStefan Hetzl, Raheleh Jalali. [doi]
• Local consistency as a reduction between constraint satisfaction problemsVíctor Dalmau, Jakub Oprsal. [doi]
• Natural numbers from integersChristian Sattler, David Wärn. [doi]
• Braids, Twists, Trace and Duality in Combinatory AlgebrasMasahito Hasegawa, Serge Lechenne. [doi]
• Finite-valued Streaming String TransducersEmmanuel Filiot, Ismaël Jecker, Christof Löding, Anca Muscholl, Gabriele Puppis, Sarah Winter. [doi]
• Non-Elementary Compression of First-Order Proofs in Deep Inference Using Epsilon-TermsCameron Allett. [doi]
• The Relational Machine CalculusChris Barrett, Daniel Castle, Willem Heijltjes. [doi]
• Pushdown Normal-Form Bisimulation: A Nominal Context-Free Approach to Program EquivalenceVasileios Koutavas, Yu-Yang Lin, Nikos Tzevelekos. [doi]
• Bounding the Weisfeiler-Leman Dimension via a Depth Analysis of I/R-TreesSandra Kiefer, Daniel Neuen. [doi]
• Determinisation and Unambiguisation of Polynomially-Ambiguous Rational Weighted AutomataIsmaël Jecker, Filip Mazowiecki, David Purser. [doi]
• On symmetries of spheres in univalent foundationsPierre Cagne, Ulrik Torben Buchholtz, Nicolai Kraus, Marc Bezem. [doi]
• From Quantifier Depth to Quantifier Number: Separating Structures with k VariablesHarry Vinall-Smeeth. [doi]
• Decidability and Complexity of Decision Problems for Affine Continuous VASSA. R. Balasubramanian. [doi]
• Concurrent Games over Relational Structures: The Origin of Game ComonadsYoàv Montacute, Glynn Winskel. [doi]
• Are Targeted Messages More Effective?Martin Grohe, Eran Rosenbluth. [doi]
• A Nominal Approach to Probabilistic Separation LogicJohn M. Li, Jon Aytac, Philip Johnson-Freyd, Amal Ahmed 0001, Steven Holtzen. [doi]
• Decidability of Quasi-Dense Modal LogicsTim Lyon, Piotr Ostropolski-Nalewaja. [doi]
• A Syntax for Strictly Associative and Unital ∞-CategoriesEric Finster, Alex Rice, Jamie Vicary. [doi]
• Injective hardness condition for PCSPsDemian Banakh, Marcin Kozik. [doi]
• First order distinguishability of sparse random graphsTal Hershko, Maksim Zhukovskii. [doi]
• Declassification Policy for Program Complexity AnalysisEmmanuel Hainry, Bruce M. Kapron, Jean-Yves Marion, Romain Péchoux. [doi]
• Relevant S is UndecidableSøren Brinck Knudstorp. [doi]
• Genericity Through StratificationVictor Arrial, Giulio Guerrieri, Delia Kesner. [doi]
• No Go Theorems: Directed Containers That Do Not Distribute Over Distribution MonadsAmin Karamlou, Nihil Shah. [doi]
• Positional ω-regular languagesAntonio Casares, Pierre Ohlmann. [doi]
• Discounted-Sum Automata with Real-Valued Discount FactorsUdi Boker. [doi]
• A proof theory of right-linear (ω-)grammars via cyclic proofsAnupam Das, Abhishek De 0001. [doi]
• Dot-depth three, return of the J-classThomas Place, Marc Zeitoun. [doi]
• A Characterisation Theorem for Two-Way Bisimulation-Invariant Monadic Least Fixpoint Logic Over Finite StructuresMaximilian Pflueger, Johannes Marti, Egor V. Kostylev. [doi]
• The Complexity of Resilience Problems via Valued Constraint Satisfaction ProblemsManuel Bodirsky, Zaneta Semanisinová, Carsten Lutz. [doi]
• Effectful semantics in bicategories: strong, commutative, and concurrent pseudomonadsHugo Paquet, Philip Saville. [doi]
• Elementary first-order model checking for sparse graphsJakub Gajarský, Michal Pilipczuk, Marek Sokolowski 0001, Giannos Stamoulis, Szymon Torunczyk. [doi]
• Slice closures of indexed languages and word equations with counting constraintsLaura Ciobanu, Georg Zetzsche. [doi]
• Quantum advantage and CSP complexityLorenzo Ciardo. [doi]
• A Profunctorial Semantics for Quantum SupermapsJames Hefford, Matthew Wilson. [doi]
• Verifying Unboundedness via AmalgamationAshwani Anand, Sylvain Schmitz, Lia Schütze, Georg Zetzsche. [doi]
• Combining fixpoint and differentiation theoryZeinab Galal, Jean-Simon Pacaud Lemay. [doi]
• Element-free probability distributions and random partitionsVictor Blanchi, Hugo Paquet. [doi]
• Bialgebraic Reasoning on Higher-order Program EquivalenceSergey Goncharov 0001, Stefan Milius, Stelios Tsampas 0001, Henning Urbat. [doi]
• Separating Markov's PrinciplesLiron Cohen 0001, Yannick Forster 0002, Dominik Kirst, Bruno da Rocha Paiva, Vincent Rahli. [doi]
• Rank-decreasing transductionsMikolaj Bojanczyk, Pierre Ohlmann. [doi]
• Initial Algebras Unchained - A Novel Initial Algebra Construction Formalized in AgdaThorsten Wißmann, Stefan Milius. [doi]
• Bounded-Memory Strategies in Partial-Information GamesSougata Bose, Rasmus Ibsen-Jensen, Patrick Totzke. [doi]
• The Finite Satisfiability Problem for PCTL is UndecidableMiroslav Chodil, Antonín Kucera 0001. [doi]
• Primitive Recursive Dependent Type TheoryUlrik Torben Buchholtz, Johannes Schipp von Branitz. [doi]