Canonical Models and the Complexity of Modal Team Logic

Safety, Absoluteness, and Computability

Submodular Functions and Valued Constraint Satisfaction Problems over Infinite Domains

Finite bisimulations for dynamical systems with overlapping trajectories

Dependency Concepts up to Equivalence

Quantifying Bounds in Strategy Logic

Graphical Conjunctive Queries

Combining Linear Logic and Size Types for Implicit Complexity

Fully abstract models of the probabilistic lambda-calculus

Climbing up the elementary complexity classes with theories of automatic structures

Basic operational preorders for algebraic effects in general, and for combined probability and nondeterminism in particular

A Contextual Reconstruction of Monadic Reflection

Approximating Probabilistic Automata

The True Concurrency of Herbrand's Theorem

An application of parallel cut elimination in unit-free multiplicative linear logic to the Taylor expansion of proof nets

Symmetric Circuits for Rank Logic

Quantitative Foundations for Resource Theories

Non-wellfounded proof theory for (Kleene+action)(algebras+lattices)

Relating Structure and Power: Comonadic Semantics for Computational Resources

Beyond admissibility: Dominance between chains of strategies

Rule Algebras for Adhesive Categories

Uniform Inductive Reasoning in Transitive Closure Logic via Infinite Descent

Synthesizing Optimally Resilient Controllers

Definable Inapproximability: New Challenges for Duplicator

Parity Games with Weights

High-level arities and initial semantics

Expressivity within second-order transitive-closure logic

On compositionality of dinatural transformations

A Fully Abstract Game Semantics for Countable Nondeterminism

Cartesian Cubical Computational Type Theory: Constructive Reasoning with Paths and Equalities

An algebraic decision procedure for two-variable logic with a between relation

Local validity for circular proofs in linear logic with fixed points

A recursion-theoretic characterisation of the positive polynomial-time functions

MacNeille completion and Buchholz' Omega rule for parameter-free second order logics

A Decidable Fragment of Second Order Logic With Applications to Synthesis

Beyond Polarity: Towards A Multi-Discipline Intermediate Language with Sharing