Table of Contents

• Axiomatizations and Computability of Weighted Monadic Second-Order LogicAntonis Achilleos, Mathias Ruggaard Pedersen. 1-13 [doi]
• Assuming Just Enough Fairness to make Session Types Complete for Lock-freedomRob van Glabbeek, Peter Höfner, Ross Horne. 1-13 [doi]
• A Normal Form Characterization for Efficient Boolean Skolem Function SynthesisPreey Shah, Aman Bansal, S. Akshay, Supratik Chakraborty. 1-13 [doi]
• An Algebraic Characterisation of First-Order Logic with NeighbourAmaldev Manuel, Dhruv Nevatia. 1-13 [doi]
• Positive First-order Logic on WordsDenis Kuperberg. 1-13 [doi]
• On sequentiality and well-bracketing in the π-calculusDaniel Hirschkoff, Enguerrand Prebet, Davide Sangiorgi. 1-13 [doi]
• No-Rainbow Problem and the Surjective Constraint Satisfaction ProblemDmitriy Zhuk. 1-7 [doi]
• Finite Model Theory of the Triguarded Fragment and Related LogicsEmanuel Kieronski, Sebastian Rudolph. 1-13 [doi]
• Demonic Lattices and Semilattices in Relational Semigroups with Ordinary CompositionRobin Hirsch, Jas Semrl. 1-10 [doi]
• The Logic of Graph Neural NetworksMartin Grohe. 1-17 [doi]
• Some constructive variants of S4 with the finite model propertyPhilippe Balbiani, Martín Diéguez, David Fernández Duque. 1-13 [doi]
• Categorical models of Linear Logic with fixed points of formulasThomas Ehrhard, Farzad Jafar-Rahmani. 1-13 [doi]
• Parameterized Complexity of Elimination Distance to First-Order Logic PropertiesFedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos. 1-13 [doi]
• Combining Nondeterminism, Probability, and Termination: Equational and Metric ReasoningMatteo Mio, Ralph Sarkis, Valeria Vignudelli. 1-14 [doi]
• Initial Limit Datalog: a New Extensible Class of Decidable Constrained Horn ClausesToby Cathcart Burn, Luke Ong, Steven J. Ramsay, Dominik Wagner. 1-13 [doi]
• Comonadic semantics for guarded fragmentsSamson Abramsky, Dan Marsden. 1-13 [doi]
• Combinatorial Proofs and Decomposition Theorems for First-order LogicDominic J. D. Hughes, Lutz Straßburger, Jui-Hsuan Wu. 1-13 [doi]
• Behavioural Preorders via Graded MonadsChase Ford, Stefan Milius, Lutz Schröder. 1-13 [doi]
• Orbit-Finite-Dimensional Vector Spaces and Weighted Register AutomataMikolaj Bojanczyk, Bartek Klin, Joshua Moerman. 1-13 [doi]
• Fusible numbers and Peano ArithmeticJeff Erickson 0001, Gabriel Nivasch, Junyan Xu. 1-13 [doi]
• Verifying higher-order concurrency with data automataAlex Dixon, Ranko Lazic, Andrzej S. Murawski, Igor Walukiewicz. 1-13 [doi]
• Decidability and Complexity in Weakening and Contraction Hypersequent Substructural LogicsA. R. Balasubramanian, Timo Lang, Revantha Ramanayake. 1-13 [doi]
• Asynchronous Extensions of HyperLTLLaura Bozzelli, Adriano Peron, César Sánchez. 1-13 [doi]
• A Relational Theory of Monadic Rewriting Systems, Part IFrancesco Gavazzo, Claudia Faggian. 1-14 [doi]
• Evidenced Frames: A Unifying Framework Broadening Realizability ModelsLiron Cohen 0001, Étienne Miquey, Ross Tate. 1-13 [doi]
• Categories of NetsJohn C. Baez, Fabrizio Genovese, Jade Master, Michael Shulman. 1-13 [doi]
• On the logical structure of choice and bar induction principlesNuria Brede, Hugo Herbelin. 1-13 [doi]
• Compositional relational reasoning via operational game semanticsGuilhem Jaber, Andrzej S. Murawski. 1-13 [doi]
• Smart Choices and the Selection MonadMartín Abadi, Gordon D. Plotkin. 1-14 [doi]
• Multi-Structural Games and Number of QuantifiersRonald Fagin, Jonathan Lenchner, Kenneth W. Regan, Nikhil Vyas 0001. 1-13 [doi]
• Lovász-Type Theorems and Game ComonadsAnuj Dawar, Tomás Jakl, Luca Reggio. 1-13 [doi]
• A Constructive Logic with Classical Proofs and RefutationsPablo Barenbaum, Teodoro Freund. 1-13 [doi]
• Stochastic Processes with Expected Stopping TimeKrishnendu Chatterjee, Laurent Doyen 0001. 1-13 [doi]
• Perspective Multi-Player GamesOrna Kupferman, Noam Shenwald. 1-13 [doi]
• On the Expressive Power of Homomorphism CountsAlbert Atserias, Phokion G. Kolaitis, Wei-Lin Wu. 1-13 [doi]
• On Generalized Metric Spaces for the Simply Typed Lambda-CalculusPaolo Pistone. 1-14 [doi]
• Living without Beth and Craig: Definitions and Interpolants in the Guarded and Two-Variable FragmentsJean Christoph Jung, Frank Wolter. 1-14 [doi]
• Constraint Satisfaction Problems over Finite StructuresLibor Barto, William J. DeMeo, Antoine Mottet. 1-13 [doi]
• Gödel-McKinsey-Tarski and Blok-Esakia for Heyting-Lewis ImplicationJim de Groot, Tadeusz Litak, Dirk Pattinson. 1-15 [doi]
• Monomial size vs. Bit-complexity in Sums-of-Squares and Polynomial CalculusTuomas Hakoniemi. 1-7 [doi]
• Separating Rank Logic from Polynomial TimeMoritz Lichter. 1-13 [doi]
• Session Logical Relations for NoninterferenceFarzaneh Derakhshan, Stephanie Balzer, Limin Jia. 1-14 [doi]
• Commutative Monads for Probabilistic Programming LanguagesXiaodong Jia, Bert Lindenhovius, Michael W. Mislove, Vladimir Zamdzhiev. 1-14 [doi]
• Strong Call-by-Value is Reasonable, ImplosivelyBeniamino Accattoli, Andrea Condoluci, Claudio Sacerdoti Coen. 1-14 [doi]
• On Linear Time Decidability of Differential Privacy for Programs with Unbounded InputsRohit Chadha, A. Prasad Sistla, Mahesh Viswanathan 0001. 1-13 [doi]
• A Compositional Cost Model for the λ-calculusJames Laird. 1-13 [doi]
• Minimal Taylor Algebras as a Common Framework for the Three Algebraic Approaches to the CSPLibor Barto, Zarathustra Brady, Andrei Bulatov, Marcin Kozik, Dmitriy Zhuk. 1-13 [doi]
• Lacon- and Shrub-Decompositions: A New Characterization of First-Order Transductions of Bounded Expansion ClassesJan Dreier. 1-13 [doi]
• A Quantum Interpretation of Bunched Logic & Quantum Separation LogicLi Zhou, Gilles Barthe, Justin Hsu, Mingsheng Ying, Nengkun Yu. 1-14 [doi]
• The Topological Mu-Calculus: completeness and decidabilityAlexandru Baltag, Nick Bezhanishvili, David Fernández Duque. 1-13 [doi]
• Fixed-Points for Quantitative Equational LogicsRadu Mardare, Prakash Panangaden, Gordon D. Plotkin. 1-13 [doi]
• A Logic for Locally Complete Abstract InterpretationsRoberto Bruni, Roberto Giacobazzi, Roberta Gori, Francesco Ranzato. 1-13 [doi]
• Zero-one laws for provability logic: Axiomatizing validity in almost all models and almost all framesRineke Verbrugge. 1-13 [doi]
• The Undecidability of System F Typability and Type Checking for ReductionistsAndrej Dudenhefner. 1-10 [doi]
• Intersection Type DistributorsFederico Olimpieri. 1-15 [doi]
• SD-Regular Transducer Expressions for Aperiodic TransformationsLuc Dartois, Paul Gastin, Shankara Narayanan Krishna. 1-13 [doi]
• In search of lost time: Axiomatising parallel composition in process algebrasLuca Aceto, Elli Anastasiadi, Valentina Castiglioni, Anna Ingólfsdóttir, Bas Luttik. 1-14 [doi]
• A distributed operational view of Reversible Prime Event StructuresHernán C. Melgratti, Claudio Antares Mezzina, G. Michele Pinna. 1-13 [doi]
• Universal Semantics for the Stochastic λ-CalculusPedro H. Azevedo de Amorim, Dexter Kozen, Radu Mardare, Prakash Panangaden, Michael Roberts. 1-12 [doi]
• Alignment Completeness for Relational Hoare LogicsRamana Nagasamudram, David A. Naumann. 1-13 [doi]
• Responsibility and verification: Importance value in temporal logicsCorto Mascle, Christel Baier, Florian Funkev, Simon Jantsch, Stefan Kiefer. 1-14 [doi]
• Forbidden Induced Subgraphs and the Łoś-Tarski TheoremYijia Chen, Jörg Flum. 1-13 [doi]
• Parametricity and Semi-Cubical TypesHugo Moeneclaey. 1-11 [doi]
• A Complete Axiomatisation for Divergence Preserving Branching Congruence of Finite-State BehavioursXinxin Liu 0009, Tingting Yu. 1-13 [doi]
• The Space of InteractionBeniamino Accattoli, Ugo Dal Lago, Gabriele Vanoni. 1-13 [doi]
• Graphical Language with Delayed Trace: Picturing Quantum Computing with Finite MemoryTitouan Carette, Marc de Visme, Simon Perdrix. 1-13 [doi]
• From Finite-Valued Nondeterministic Transducers to Deterministic Two-Tape AutomataElisabet Burjons, Fabian Frei, Martin Raszyk. 1-13 [doi]
• Continuous One-Counter AutomataMichael Blondin, Tim Leys, Filip Mazowiecki, Philip Offtermatt, Guillermo A. Pérez 0001. 1-13 [doi]
• Internal ∞-Categorical Models of Dependent Type Theory : Towards 2LTT Eating HoTTNicolai Kraus. 1-14 [doi]
• Inapproximability of Unique Games in Fixed-Point Logic with CountingJamie Tucker-Foltz. 1-13 [doi]
• The Smash Product of Monoidal TheoriesAmar Hadzihasanovic. 1-13 [doi]
• The Laplace Mechanism has optimal utility for differential privacy over continuous queriesNatasha Fernandes, Annabelle McIver, Carroll Morgan. 1-12 [doi]
• Types Are Internal ∞-GroupoidsEric Finster, Antoine Allioux, Matthieu Sozeau. 1-13 [doi]
• PTAS for Sparse General-Valued CSPsBalázs F. Mezei, Marcin Wrochna, Stanislav Zivný. 1-11 [doi]
• From Multisets over Distributions to Distributions over MultisetsBart Jacobs 0001. 1-13 [doi]
• Asynchronous Template Games and the Gray Tensor Product of 2-CategoriesPaul-André Melliès. 1-13 [doi]
• Expressivity of Quantitative Modal Logics : Categorical Foundations via Codensity and ApproximationYuichi Komorida, Shin-ya Katsumata, Clemens Kupke, Jurriaan Rot, Ichiro Hasuo. 1-14 [doi]
• Efficient Local Computation of Differential Bisimulations via Coupling and Up-to MethodsGiorgio Bacci, Giovanni Bacci 0001, Kim G. Larsen, Mirco Tribastone, Max Tschaikowski, Andrea Vandin. 1-14 [doi]
• Normalization for Cubical Type TheoryJonathan Sterling, Carlo Angiuli. 1-15 [doi]
• Compositional Semantics for Probabilistic Programs with Exact ConditioningDario Stein, Sam Staton. 1-13 [doi]
• Complexity Lower Bounds from Algorithm DesignR. Ryan Williams. 1-3 [doi]
• Parikh's theorem for infinite alphabetsPiotr Hofman, Marta Juzepczuk, Slawomir Lasota 0001, Mohnish Pattathurajan. 1-13 [doi]
• Quantitative and Approximate MonitoringThomas A. Henzinger, N. Ege Saraç. 1-14 [doi]
• Towards a more efficient approach for the satisfiability of two-variable logicTing-Wei Lin, Chia-Hsuan Lu, Tony Tan. 1-13 [doi]
• On Logics and Homomorphism ClosureManuel Bodirsky, Thomas Feller, Simon Knäuer, Sebastian Rudolph. 1-13 [doi]
• Abstraction in Data IntegrationGianluca Cima, Marco Console, Maurizio Lenzerini, Antonella Poggi. 1-11 [doi]
• Supermartingales, Ranking Functions and Probabilistic Lambda CalculusAndrew Kenyon-Roberts, C.-H. Luke Ong. 1-13 [doi]
• Symbolic Time and Space Tradeoffs for Probabilistic VerificationKrishnendu Chatterjee, Wolfgang Dvorák, Monika Henzinger, Alexander Svozil. 1-13 [doi]
• Canonical Polymorphisms of Ramsey Structures and the Unique Interpolation PropertyManuel Bodirsky, Bertalan Bodor. 1-13 [doi]
• A Bunched Logic for Conditional IndependenceJialu Bao, Simon Docherty, Justin Hsu, Alexandra Silva 0001. 1-14 [doi]
• Removing Redundant Refusals: Minimal Complete Test Suites for Failure Trace SemanticsMaciej Gazda, Robert M. Hierons. 1-13 [doi]
• Global Optimisation with Constructive RealsDan R. Ghica, Todd Waugh Ambridge. 1-13 [doi]
• Universal Skolem SetsFlorian Luca, Joël Ouaknine, James Worrell 0001. 1-6 [doi]
• Higher LensesPaolo Capriotti, Nils Anders Danielsson, Andrea Vezzosi. 1-13 [doi]
• First-Order Reasoning and Efficient Semi-Algebraic ProofsFedor Part, Neil Thapen, Iddo Tzameret. 1-13 [doi]