Table of Contents

• Normalization for Multimodal Type TheoryDaniel Gratzer. [doi]
• On the strength of Sherali-Adams and Nullstellensatz as propositional proof systemsIlario Bonacina, Maria Luisa Bonet. [doi]
• On the Skolem Problem and the Skolem ConjectureRichard Lipton, Florian Luca, Joris Nieuwveld, Joël Ouaknine, David Purser, James Worrell 0001. [doi]
• Quantum Expectation Transformers for Cost AnalysisMartin Avanzini, Georg Moser, Romain Péchoux, Simon Perdrix, Vladimir Zamdzhiev. [doi]
• Linear-Algebraic Models of Linear Logic as Categories of Modules over Σ-Semirings✱Takeshi Tsukada, Kazuyuki Asada. [doi]
• The amazing mixed polynomial closure and its applications to two-variable first-order logicThomas Place. [doi]
• The Pebble-Relation Comonad in Finite Model TheoryYoàv Montacute, Nihil Shah. [doi]
• Zigzag normalisation for associative n-categoriesLukas Heidemann, David Reutter, Jamie Vicary. [doi]
• Bouncing Threads for Circular and Non-Wellfounded Proofs: Towards Compositionality with Circular ProofsDavid Baelde, Amina Doumane, Denis Kuperberg, Alexis Saurin. [doi]
• Ramsey Quantifiers over Automatic Structures: Complexity and Applications to VerificationPascal Bergsträßer, Moses Ganardi, Anthony W. Lin, Georg Zetzsche. [doi]
• A Type Theory for Strictly Unital ∞-CategoriesEric Finster, David Reutter, Jamie Vicary, Alex Rice. [doi]
• Cyclic Implicit ComplexityGianluca Curzi, Anupam Das 0002. [doi]
• A first-order completeness result about characteristic Boolean algebras in classical realizabilityGuillaume Geoffroy. [doi]
• Identity Testing for Radical ExpressionsNikhil Balaji, Klara Nosan, Mahsa Shirmohammadi, James Worrell 0001. [doi]
• Varieties of Quantitative Algebras and Their MonadsJirí Adámek. [doi]
• A Functorial Excursion Between Algebraic Geometry and Linear LogicPaul-André Melliès. [doi]
• Characterizing Positionality in Games of Infinite Duration over Infinite GraphsPierre Ohlmann. [doi]
• The complexity of soundness in workflow netsMichael Blondin, Filip Mazowiecki, Philip Offtermatt. [doi]
• Treelike Decompositions for Transductions of Sparse GraphsJan Dreier, Jakub Gajarský, Sandra Kiefer, Michal Pilipczuk, Szymon Torunczyk. [doi]
• Smooth approximations and CSPs over finitely bounded homogeneous structuresAntoine Mottet, Michael Pinsker. [doi]
• Lower Bounds for the Reachability Problem in Fixed Dimensional VASSesWojciech Czerwinski, Lukasz Orlikowski. [doi]
• Stable graphs of bounded twin-widthJakub Gajarský, Michal Pilipczuk, Szymon Torunczyk. [doi]
• The Regular Languages of First-Order Logic with One AlternationCorentin Barloy, Michaël Cadilhac, Charles Paperman, Thomas Zeume. [doi]
• Milner's Proof System for Regular Expressions Modulo Bisimilarity is Complete: Crystallization: Near-Collapsing Process Graph Interpretations of Regular ExpressionsClemens Armin Grabmayer. [doi]
• A direct computational interpretation of second-order arithmetic via update recursionValentin Blot. [doi]
• On the Satisfiability of Context-free String Constraints with Subword-OrderingC. Aiswarya, Soumodev Mal, Prakash Saivasan. [doi]
• The boundedness and zero isolation problems for weighted automata over nonnegative rationalsWojciech Czerwinski, Engel Lefaucheux, Filip Mazowiecki, David Purser, Markus A. Whiteland. [doi]
• Resource approximation for the λμ-calculusDavide Barbarossa. [doi]
• Geometric decision procedures and the VC dimension of linear arithmetic theoriesDmitry Chistikov 0001, Christoph Haase, Alessio Mansutti. [doi]
• Exponentials as Substitutions and the Cost of Cut Elimination in Linear LogicBeniamino Accattoli. [doi]
• Active learning for sound negotiations✱Anca Muscholl, Igor Walukiewicz. [doi]
• Greatest HITs: Higher inductive types in coinductive definitions via induction under clocksMagnus Baunsgaard Kristensen, Rasmus Ejlers Møgelberg, Andrea Vezzosi. [doi]
• Transducers of polynomial growthMikolaj Bojanczyk. [doi]
• Separating LREC from LFPAnuj Dawar, Felipe Ferreira Santos. [doi]
• On Almost-Uniform Generation of SAT Solutions: The power of 3-wise independent hashingRemi Delannoy, Kuldeep S. Meel. [doi]
• Reasoning on Data Words over Numeric DomainsDiego Figueira, Anthony Widjaja Lin. [doi]
• Zero-One Laws and Almost Sure Valuations of First-Order Logic in Semiring SemanticsErich Grädel, Hayyan Helal, Matthias Naaf, Richard Wilke. [doi]
• Curry and Howard Meet BorelMelissa Antonelli, Ugo Dal Lago, Paolo Pistone. [doi]
• The Complexity of Bidirected Reachability in Valence SystemsMoses Ganardi, Rupak Majumdar, Georg Zetzsche. [doi]
• When Locality Meets PreservationAliaume Lopez. [doi]
• Partitions and Ewens Distributions in element-free Probability TheoryBart Jacobs 0001. [doi]
• Solvability of orbit-finite systems of linear equationsArka Ghosh 0002, Piotr Hofman, Slawomir Lasota 0001. [doi]
• Logical Foundations of Quantitative EqualityFrancesco Dagnino, Fabio Pasquali. [doi]
• Size measures and alphabetic equivalence in the μ-calculusClemens Kupke, Johannes Marti, Yde Venema. [doi]
• Model Checking on Interpretations of Classes of Bounded Local CliquewidthÉdouard Bonnet, Jan Dreier, Jakub Gajarský, Stephan Kreutzer, Nikolas Mählmann, Pierre Simon, Szymon Torunczyk. [doi]
• Computing the Density of the Positivity Set for Linear Recurrence SequencesEdon Kelmendi. [doi]
• Stochastic Games with Synchronizing ObjectivesLaurent Doyen 0001. [doi]
• Complexity of Modular CircuitsPawel M. Idziak, Piotr Kawalek, Jacek Krzaczkowski. [doi]
• Probability monads with submonads of deterministic statesSean K. Moss, Paolo Perrone. [doi]
• Efficient Construction of Reversible Transducers from Regular Transducer ExpressionsLuc Dartois, Paul Gastin, R. Govind 0001, Shankara Narayanan Krishna. [doi]
• Abstractions for the local-time semantics of timed automata: a foundation for partial-order methodsR. Govind 0001, Frédéric Herbreteau, B. Srivathsan, Igor Walukiewicz. [doi]
• Concrete categories and higher-order recursion: With applications including probability, differentiability, and full abstractionCristina Matache, Sean K. Moss, Sam Staton. [doi]
• Graded Monads and Behavioural Equivalence GamesChase Ford, Stefan Milius, Lutz Schröder, Harsh Beohar, Barbara König 0001. [doi]
• Semantics for two-dimensional type theoryBenedikt Ahrens, Paige Randall North, Niels van der Weide. [doi]
• Probabilistic Verification Beyond Context-FreenessGuanyan Li, Andrzej S. Murawski, Luke Ong. [doi]
• Temporal Team Semantics RevisitedJens Oliver Gutsfeld, Arne Meier, Christoph Ohrem, Jonni Virtema. [doi]
• Quantum Weakest Preconditions for Reasoning about Expected Runtimes of Quantum ProgramsJunyi Liu, Li Zhou, Gilles Barthe, Mingsheng Ying. [doi]
• Choiceless Polynomial Time with Witnessed Symmetric ChoiceMoritz Lichter, Pascal Schweitzer. [doi]
• Beyond Nonexpansive Operations in Quantitative Algebraic ReasoningMatteo Mio, Ralph Sarkis, Valeria Vignudelli. [doi]
• Syllepsis in Homotopy Type TheoryKristina Sojakova, G. A. Kavvos. [doi]
• Monoidal Streams for Dataflow ProgrammingElena Di Lavore, Giovanni de Felice, Mario Román. [doi]
• Reasonable Space for the λ-Calculus, LogarithmicallyBeniamino Accattoli, Ugo Dal Lago, Gabriele Vanoni. [doi]
• Computable PAC Learning of Continuous FeaturesNathanael L. Ackerman, Julian Asilis, Jieqi Di, Cameron E. Freer, Jean-Baptiste Tristan. [doi]
• Deciding Hyperproperties Combined with Functional SpecificationsRaven Beutner, David Carral, Bernd Finkbeiner, Jana Hofmann, Markus Krötzsch. [doi]