Linear Combinations of Unordered Data Vectors

An interpretation of system F through bar recursion

On the extension of computable real functions

Logics for Continuous Reachability in Petri Nets and Vector Addition Systems with States

Foundation for a Series of Efficient Simulation Algorithms

Separation for Dot-Depth Two

Foundational Nonuniform (Co)datatypes for Higher-Order Logic

Common Knowledge and Multi-Scale Locality Analysis in Cayley Structures

Herbrand Property: Finite Quasi-Herbrand Models and Lifting Chandra-Merlin Theorem to Quantified Conjunctive Queries

Bar Induction: The Good, the Bad, and the Ugly

Constructive completeness for the linear-time mu-calculus

Gödel Logic: From Natural Deduction to Parallel Computation

Higher-order parity automata

Large scale geometries of infinite strings

Regular Separability of One Counter Automata

Learning first-order definable concepts over structures of small degree

The Descriptive Complexity of Solving Linear Equation Systems and its Applications

Definability of Summation Problems for Abelian Groups and Semigroups

Timed pushdown automata and branching vector addition systems

Fibred Fibration Categories

The Logic of Counting Query Answers

Enumeration Reducibility in Closure Spaces with Applications to Logic and Algebra

The Limits of SDP Relaxations for General-Valued CSPs

Cut-free Completeness for Modal Mu-Calculus

Dual-Context Calculi for Modal Logic

Computing Quantiles in Markov Chains with Multi-Dimensional Costs

Riesz Modal Logic for Markov Processes

Succinct progress measures for solving parity games

Generalised Species of Rigid Resource Terms

A fine-grained hierarchy of hard problems in the separated fragment

A categorical semantics for causal structure

On Delay and Regret Determinization of Max-Plus Automata

The Clocks Are Ticking: No More Delays! Reduction Semantics for Type Theory with Guarded Recursion

Revisiting Reachability in Timed Automata

Uniform, Integral and Efficient Proofs for the Determinant Identities

Parity Objectives in Countable MDPs

Polynomial Automata: Zeroness and Applications

On Axiomatizability of the Quantitative Algebras

Infinitary Intersection Types as Sequences: a New Answer to Klop’s Problem

Foundations of Information Integration under Bag Semantics

Perfect Half Space Games

The Homomorphism Problem for Regular Graph Patterns

The Weisfeiler-Leman dimension of planar graphs is at most 3

Definability of Semidefinite Programming and Lasserre Lower Bounds for CSPs

A monad for full ground reference cells

Quotients in monadic programming: Projective algebras are equivalent to coalgebras

Register automata with linear arithmetic

The Geometry of Concurrent Interaction: Handling Multiple Ports by Way of Multiple Tokens

An Effectful Way to Eliminate Addiction to Dependence

Equivalence of Inductive Definitions and Cyclic Proofs under Arithmetic

Model-checking for successor-invariant first-order formulas on graph classes of bounded expansion

The Complexity of Minimal Inference Problem for Conservative Constraint Languages

Effectful Applicative Bisimilarity: Monads, Relators, and the Howe's Method

Fully Abstract Encodings of lambda-Calculus in HOcore through Abstract Machines

The Continuity of Monadic Stream Functions

A cartesian closed category for higher-order model checking

Understanding the complexity of #SAT using knowledge compilation

The primitivity of operators in the algebra of binary relations under conjunctions of containments

Capturing Polynomial Time using Modular Decomposition

A Type-Theoretical Definition of Weak omega-Categories

Games with Costs and Delays

Verification of randomized security protocols

Typability in Bounded Dimension

The Two Dichotomy Conjectures for Infinite Domain Constraint Satisfaction Problems Are Equivalent

The Pebbling Comonad in Finite Model Theory

Stack Semantics of Type Theory

MDPs with Energy-Parity Objectives

Partial Derivatives on Graphs for Kleene Allegories

First-order logic with counting: At least, WEAK Hanf normal forms always exist and can be computed!

On Strong Determinacy of Countable Stochastic Games

Domains and Event Structures for Fusions

Strategy Logic with Imperfect Information

A Convenient Category for Higher-Order Probability Theory

Untwisting two-way transducers in elementary time

Bounded time computation on metric spaces and Banach spaces

Quantifiers on languages and codensity monads

Decidability, complexity, and expressiveness of first-order logic over the subword ordering

Lean and Full Congruence Formats for Recursion

Differentiation in Logical Form

Static Analysis of Deterministic Negotiations

On shift-invariant maximal filters and hormonal cellular automata

The real projective spaces in homotopy type theory

Data structures for quasistrict higher categories

A Crevice on the Crane Beach: Finite-Degree Predicates

Constraint Satisfaction Problems over semilattice block Mal'tsev algebras

Descriptive Complexity for Counting Complexity Classes

Comparator automata in quantitative verification

Categorical Liveness Checking by Corecursive Algebras

Unrestricted Stone Duality for Markov Processes

A Weakest Pre-Expectation Semantics for Mixed-Sign Expectations

The symposium is sponsored by ACM SIGLOG and the IEEE Technical Committee on Mathematical Foundations of Computing, and by Microsoft Research and Google, in cooperation with the Association for Symbolic Logic, the European Association for Theoretical Computer Science, Reyjavik University, and the Icelandic Centre of Excellence in Theoretical Computer Science.

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