Table of Contents

• A Metalanguage for Cost-Aware Denotational SemanticsYue Niu, Robert Harper 0001. 1-14 [doi]
• Deterministic stream-sampling for probabilistic programming: semantics and verificationFredrik Dahlqvist, Alexandra Silva 0001, William Smith. 1-13 [doi]
• Expressive Completeness of Two-Variable First-Order Logic with Counting for First-Order Logic Queries on Rooted Unranked TreesJelle Hellings, Marc Gyssens, Jan Van den Bussche, Dirk Van Gucht. 1-13 [doi]
• Folding interpretationsMikolaj Bojanczyk. 1-13 [doi]
• Applications of Information Inequalities to Database Theory ProblemsDan Suciu. 1-30 [doi]
• Revisiting Membership Problems in Subclasses of Rational RelationsPascal Bergsträßer, Moses Ganardi. 1-14 [doi]
• The Descriptive Complexity of Graph Neural NetworksMartin Grohe. 1-14 [doi]
• Minimization of Dynamical Systems over MonoidsGeorgios Argyris, Alberto Lluch-Lafuente, Alexander Leguizamon-Robayo, Mirco Tribastone, Max Tschaikowski, Andrea Vandin. 1-14 [doi]
• Logic for Explainable AIAdnan Darwiche. 1-11 [doi]
• The Big-O Problem for Max-Plus Automata is Decidable (PSPACE-Complete)Laure Daviaud, David Purser. 1-13 [doi]
• Central Submonads and Notions of Computation: Soundness, Completeness and Internal LanguagesTitouan Carette, Louis Lemonnier, Vladimir Zamdzhiev. 1-13 [doi]
• Allegories of Symbolic ManipulationsFrancesco Gavazzo. 1-15 [doi]
• Evidential Decision Theory via Partial Markov CategoriesElena Di Lavore, Mario Román. 1-14 [doi]
• The Power of PositivityToghrul Karimov, Edon Kelmendi, Joris Nieuwveld, Joël Ouaknine, James Worrell 0001. 1-11 [doi]
• Verifying linear temporal specifications of constant-rate multi-mode systemsMichael Blondin, Philip Offtermatt, Alex Sansfaçon-Buchanan. 1-13 [doi]
• A Higher-Order Indistinguishability Logic for Cryptographic ReasoningDavid Baelde, Adrien Koutsos, Joseph Lallemand. 1-13 [doi]
• *Dario Della Monica, Angelo Montanari, Gabriele Puppis, Pietro Sala. 1-12 [doi]
• Commutativity in Automated VerificationAzadeh Farzan. 1-7 [doi]
• Pseudorandom Finite ModelsJan Dreier, Jamie Tucker-Foltz. 1-13 [doi]
• Higher-Dimensional Subdiagram MatchingAmar Hadzihasanovic, Diana Kessler. 1-13 [doi]
• On Exact Sampling in the Two-Variable Fragment of First-Order LogicYuanhong Wang, Juhua Pu, Yuyi Wang 0001, Ondrej Kuzelka. 1-13 [doi]
• Structure-Aware Lower Bounds and Broadening the Horizon of Tractability for QBFJohannes Klaus Fichte, Robert Ganian, Markus Hecher, Friedrich Slivovsky, Sebastian Ordyniak. 1-14 [doi]
• Stochastic Best-Effort Strategies for Borel GoalsBenjamin Aminof, Giuseppe De Giacomo, Sasha Rubin, Florian Zuleger. 1-13 [doi]
• Cut-Restriction: From Cuts to Analytic CutsAgata Ciabattoni, Timo Lang, Revantha Ramanayake. 1-13 [doi]
• PDL on Steroids: on Expressive Extensions of PDL with Intersection and ConverseDiego Figueira, Santiago Figueira, Edwin Pin Baque. 1-13 [doi]
• Automatic Amortized Resource Analysis with Regular Recursive TypesJessie Grosen, David M. Kahn, Jan Hoffmann 0002. 1-14 [doi]
• Completeness for arbitrary finite dimensions of ZXW-calculus, a unifying calculusBoldizsár Poór, Quanlong Wang, Razin A. Shaikh, Lia Yeh, Richie Yeung, Bob Coecke. 1-14 [doi]
• Intuitionistic S4 is decidableMarianna Girlando, Roman Kuznets, Sonia Marin, Marianela Morales, Lutz Straßburger. 1-13 [doi]
• Multiplicity Problems on Algebraic Series and Context-Free GrammarsNikhil Balaji, Lorenzo Clemente, Klara Nosan, Mahsa Shirmohammadi, James Worrell 0001. 1-12 [doi]
• Making Concurrency FunctionalGlynn Winskel. 1-14 [doi]
• A categorical account of composition methods in logicTomás Jakl, Dan Marsden, Nihil Shah. 1-14 [doi]
• Distal Combinatorial Tools for Graphs of Bounded Twin-WidthWojciech Przybyszewski. 1-13 [doi]
• Reachability in Injective Piecewise Affine MapsFaraz Ghahremani, Edon Kelmendi, Joël Ouaknine. 1-11 [doi]
• Weak Similarity in Higher-Order Mathematical Operational SemanticsHenning Urbat, Stelios Tsampas 0001, Sergey Goncharov 0001, Stefan Milius, Lutz Schröder. 1-13 [doi]
• Orbit-finite linear programmingArka Ghosh 0002, Piotr Hofman, Slawomir Lasota 0001. 1-14 [doi]
• 2Ruiwen Dong 0001. 1-13 [doi]
• *Damian Niwinski, Pawel Parys, Michal Skrzypczak. 1-13 [doi]
• Computing the linear hull: Deciding Deterministic? and Unambiguous? for weighted automata over fieldsJason P. Bell, Daniel Smertnig. 1-13 [doi]
• On the Growth Rates of Polyregular FunctionsMikolaj Bojanczyk. 1-13 [doi]
• A system of inference based on proof search: an extended abstractDale Miller 0001. 1-11 [doi]
• Complete Graphical Language for Hermiticity-Preserving SuperoperatorsTitouan Carette, Timothée Hoffreumon, Émile Larroque, Renaud Vilmart. 1-22 [doi]
• The Iteration Number of the Weisfeiler-Leman AlgorithmMartin Grohe, Moritz Lichter, Daniel Neuen. 1-13 [doi]
• Computational expressivity of (circular) proofs with fixed pointsGianluca Curzi, Anupam Das 0002. 1-13 [doi]
• From Thin Concurrent Games to Generalized Species of StructuresPierre Clairambault, Federico Olimpieri, Hugo Paquet. 1-14 [doi]
• Existential Calculi of Relations with Transitive Closure: Complexity and Edge SaturationsYoshiki Nakamura. 1-13 [doi]
• Cartesian Coherent Differential CategoriesEhrhard Thomas, Aymeric Walch. 1-13 [doi]
• Quantifying Over Trees in Monadic Second-Order LogicMassimo Benerecetti, Laura Bozzelli, Fabio Mogavero, Adriano Peron. 1-13 [doi]
• Semi-Simplicial Set Models for Distributed KnowledgeÉric Goubault, Roman Kniazev, Jérémy Ledent, Sergio Rajsbaum. 1-13 [doi]
• Fixpoint operators for 2-categorical structuresZeinab Galal. 1-13 [doi]
• Stopping Criteria for Value Iteration on Stochastic Games with Quantitative ObjectivesJan Kretínský, Tobias Meggendorfer, Maximilian Weininger. 1-14 [doi]
• On Certificates, Expected Runtimes, and Termination in Probabilistic Pushdown AutomataTobias Winkler, Joost-Pieter Katoen. 1-13 [doi]
• Extensional and Non-extensional Functions as ProcessesKen Sakayori, Davide Sangiorgi. 1-13 [doi]
• Boolean symmetric vs. functional PCSP dichotomyTamio-Vesa Nakajima, Stanislav Zivný. 1-12 [doi]
• Symmetries of Graphs and Structures that Fail to Interpret a Finite ThingLibor Barto, Bertalan Bodor, Marcin Kozik, Antoine Mottet, Michael Pinsker. 1-13 [doi]
• Embedded Finite Models beyond Restricted Quantifier CollapseMichael Benedikt, Ehud Hrushovski. 1-13 [doi]
• 3) ≅Z/2Z and Computing a Brunerie Number in Cubical AgdaAxel Ljungström, Anders Mörtberg. 1-13 [doi]
• Fixed Point Logics on Hemimetric SpacesDavid Fernández Duque, Quentin Gougeon. 1-13 [doi]
• Group Separation Strikes BackThomas Place, Marc Zeitoun. 1-13 [doi]
• The Cartesian Closed Bicategory of Thin Spans of GroupoidsPierre Clairambault, Simon Forest. 1-13 [doi]
• Fully Abstract Normal Form Bisimulation for Call-by-Value PCFVasileios Koutavas, Yu-Yang Lin, Nikos Tzevelekos. 1-13 [doi]
• Taylor Expansion as a Monad in Models of DiLLMarie Kerjean, Jean-Simon Pacaud Lemay. 1-13 [doi]
• ωPAP Spaces: Reasoning Denotationally About Higher-Order, Recursive Probabilistic and Differentiable ProgramsMathieu Huot, Alexander K. Lew, Vikash K. Mansinghka, Sam Staton. 1-14 [doi]
• ℤ-polyregular functionsThomas Colcombet, Gaëtan Douéneau-Tabot, Aliaume Lopez. 1-13 [doi]
• Set-Theoretic and Type-Theoretic Ordinals CoincideTom de Jong, Nicolai Kraus, Fredrik Nordvall Forsberg, Chuangjie Xu. 1-13 [doi]
• Simulating Logspace-Recursion with Logarithmic Quantifier DepthSteffen van Bergerem, Martin Grohe, Sandra Kiefer, Luca Oeljeklaus. 1-13 [doi]
• A Complete Equational Theory for Quantum CircuitsAlexandre Clément, Nicolas Heurtel, Shane Mansfield, Simon Perdrix, Benoît Valiron. 1-13 [doi]
• Operational Algorithmic Game SemanticsBenedict Bunting, Andrzej S. Murawski. 1-13 [doi]