Decidability and Complexity for Quiescent Consistency

Reachability in Two-Dimensional Unary Vector Addition Systems with States is NL-Complete

Minimization of Symbolic Tree Automata

Invisible Pushdown Languages

Semantically Acyclic Conjunctive Queries under Functional Dependencies

Unified Semantics and Proof
System for Classical, Intuitionistic and Affine Logics

A constructive function-theoretic approach to topological compactness

Model and Objective Separation with Conditional Lower Bounds: Disjunction is Harder than Conjunction

Constructions with Non-Recursive Higher Inductive Types

The Power of Arc Consistency for CSPs Defined by Partially-Ordered Forbidden Patterns

Quantitative Automata under Probabilistic Semantics

Winning Cores in Parity Games

Divide and Congruence II: Delay and Weak Bisimilarity

Querying Visible and Invisible Information

A step up in expressiveness of decidable fixpoint logics

The Complexity of Coverability in ν-Petri Nets

Order-
Invariance of Two-Variable Logic is Decidable

Upper Bounds on the Quantifier Depth For Graph Differentiation in First Order Logic

Effective Brenier's Theorem: Applications to Computable Analysis and Algorithmic Randomness

Understanding Gentzen and Frege Systems for QBF

Towards Completeness via Proof Search in the Linear
Time Mu-calculus

Hanf normal form for first-order logic with unary counting quantifiers

Factor Varieties and Symbolic Computation

Two-variable logic with a between predicate

Graphs of relational structures: restricted colours

Quantifier Free Definability on Infinite Algebras

Goedel's functional interpretation and the concept of learning

Proving Liveness of Parameterized Programs

Distinguishing Hidden Markov Chains

Monadic second order logic as the model companion of temporal logic

Complexity Theory of (Functions on) Compact Metric Spaces

Kolmogorov Extension, Martingale Convergence, and Compositionality of Processes

Games with bound guess actions

Towards Compositional Feedback in Non-Deterministic and Non-Input-Receptive Systems

Infinitary Lambda Calculi from a Linear Perspective

Program Equivalence is Coinductive

Definability equals recognizability for graphs of bounded treewidth

Weak consistency notions for all the CSPs of bounded width

Hybrid realizability for intuitionistic and classical choice

Perfect-information Stochastic Games with Generalized Mean-Payoff Objectives

Type Theory based on Dependent Inductive
and Coinductive Types

Reducts of finitely bounded homogeneous structures, and lifting tractability from finite-domain constraint satisfaction

Denotational semantics of recursive types in synthetic guarded domain theory

Order Invariance on Decomposable
Structures

Quantitative Algebraic Reasoning

First-order definability of rational transductions: An algebraic approach

Semantics for probabilistic programming: higher-order functions, continuous distributions, and soft constraints

A bifibrational reconstruction of Lawvere's presheaf hyperdoctrine

On the Satisfiability of Some Simple Probabilistic Logics

The diagonal problem for higher-order recursive schemes is decidable

Semi-galois Categories I: The Classical Eilenberg Variety Theory

A New Perspective on FO Model Checking of Dense Graph Classes

Deciding First-Order Satisfiability when Universal and Existential Variables are Separated

Two-Way Visibly Pushdown Automata and Transducers

Data Communicating Processes with Unreliable Channels

On Thin Air Reads: Towards an Event Structures Model of Relaxed Memory

Stochastic mechanics of graph rewriting

Solvability of Matrix-Exponential Equations

Rewriting modulo symmetric monoidal structure

Church Meets Cook and Levin

How unprovable is Rabin's decidability theorem?

The algebraic dichotomy conjecture for infinite domain Constraint
Satisfaction Problems

A Mechanization of the Blakers-Massey Connectivity Theorem in Homotopy Type Theory

Reasoning about Recursive Probabilistic Programs

On Recurrent
Reachability for Continuous Linear Dynamical Systems

A Generalised Twinning Property for Minimisation of Cost Register Automata

Interacting Frobenius Algebras are Hopf.

First-order logic with reachability for infinite-state systems

Plays as Resource Terms via Non-idempotent Intersection Types

Proving Differential Privacy via Probabilistic Couplings

Differential Refinement Logic

A categorical approach to open and interconnected dynamical systems

Comparing Chemical Reaction Networks: A Categorical and Algorithmic Perspective

Conflict nets: locally canonical P-time proof nets for MALL

Near-Optimal Lower Bounds on Quantifier Depth and Weisfeiler-Leman Refinement Steps

Complexity of regular abstractions of one-counter languages

Healthiness from Duality

Coinduction All the Way Up

The Definitional Side of the Forcing

Ability to Count Messages Is Worth $\Theta(\Delta)$ Rounds in Distributed Computing

Interaction Graphs: Full Linear Logic

Fixed Points in Quantitative Semantics

From positive and intuitionistic bounded arithmetic to proof complexity

The symposium is sponsored by ACM SIGLOG and the IEEE Technical Committee on Mathematical Foundations of Computing, in cooperation with the Association for Symbolic Logic and the European Association for Theoretical Computer Science.

Website built with bootstrap by Hartmut Eilers and Eric Koskinen.