Normalization for Multimodal Type Theory

Computing the Density of the Positivity Set for Linear Recurrence Sequences

Quantum Weakest Preconditions for Reasoning about Expected Runtimes of Quantum Programs

On the Skolem Problem and the Skolem Conjecture

On the Satisfiability of Context-free String Constraints with Subword Ordering

Computable PAC Learning of Continuous Features

Identity testing for radical expressions

Varieties of quantitative algebras and their monads

Quantum Expectation Transformers for Cost Analysis

Solvability of orbit-finite systems of linear equations

Semantics for two-dimensional type theory

The Pebble-Relation Comonad in Finite Model Theory

The amazing mixed polynomial closure and its applications to two-variable first-order logic

The boundedness and zero isolation problems for weighted automata over nonnegative rationals

Logical Foundations of Quantitative Equality

On Almost-Uniform Generation of SAT Solutions: The power of 3-wise independent hashing

Size measures and alphabetic equivalence in the mu-calculus

Cyclic Implicit Complexity

The complexity of soundness in workflow nets

Active learning for sound negotiations

Characterizing Positionality in Games of Infinite Duration over Infinite Graphs

Partitions and Ewens Distributions in element-free Probability Theory

Abstractions for the local-time semantics of timed automata: a foundation for partial-order methods

On the strength of Sherali-Adams and Nullstellensatz as propositional proof systems

The complexity of bidirected reachability in valence systems

Resource approximation for the lambda-mu-calculus

Ramsey Quantifiers over Automatic Structures: Complexity and Applications to Verification

Syllepsis in Homotopy Type Theory

Choiceless Polynomial Time with Witnessed Symmetric Choice

Treelike decompositions for transductions of sparse graphs

Complexity of Modular Circuits

Probabilistic Verification Beyond Context-Freeness

Milner's Proof System for Regular Expressions Modulo Bisimilarity is Complete

Zigzag normalisation for associative n-categories

Smooth approximations and CSPs over finitely bounded homogeneous structures

Reasoning on Data Words over Numeric Domains

Probability monads with submonads of deterministic states

Stable graphs of bounded twin-width

Lower Bounds for the Reachability Problem in Fixed Dimensional VASSes

Zero-One Laws and Almost Sure Valuations of First-Order Logic in Semiring Semantics

Greatest HITs: Higher inductive types in coinductive definitions via induction under clocks

Stochastic Games with Synchronizing Objectives

Temporal Team Semantics Revisited

Curry and Howard Meet Borel

When Locality Meets Preservation

Reasonable Space for the Lambda-Calculus, Logarithmically

A Type Theory for Strictly Unital Infinity-Categories

Exponentials as Substitutions and the Cost of Cut Elimination in Linear Logic

Efficient Construction of Reversible Transducers from Regular Transducer Expressions

Monoidal Streams for Dataflow Programming

Beyond Nonexpansive Operations in Quantitative Algebraic Reasoning

A first-order completeness result about characteristic Boolean algebras in classical realizability

Model Checking on Interpretations of Classes of Bounded Local Cliquewidth

Separating LREC from LFP

Deciding Hyperproperties Combined with Functional Specifications

Concrete categories and higher-order recursion (with applications including probability, differentiability, and full abstraction)

The Regular Languages of First-Order Logic with One Alternation

Geometric decision procedures and the VC dimension of linear arithmetic theories

Linear-Algebraic Models of Linear Logic as Categories of Modules over Sigma-Semirings

Graded Monads and Behavioural Equivalence Games

A direct computational interpretation of second-order arithmetic via update recursion

Bouncing threads for circular and non-wellfounded proofs

A functorial excursion between algebraic geometry and linear logic

The symposium is sponsored by ACM SIGLOG and the IEEE Technical Committee on Mathematical Foundations of Computing.

Website by Sam Staton based on a bootstrap design by Hartmut Eilers and Eric Koskinen.