Accepted Papers

Martin Lück. Canonical Models and the Complexity of Modal Team Logic

Arnon Avron, Shahar Lev and Nissan Levi. Safety, Absoluteness, and Computability

Manuel Bodirsky, Marcello Mamino and Caterina Viola. Submodular Functions and Valued Constraint Satisfaction Problems over Infinite Domains

Vincent Jugé, Patricia Bouyer and Béatrice Bérard. Finite bisimulations for dynamical systems with overlapping trajectories

Erich Grädel and Matthias Hoelzel. Dependency Concepts up to Equivalence

Nathanaël Fijalkow, Bastien Maubert, Aniello Murano and Sasha Rubin. Quantifying Bounds in Strategy Logic

Filippo Bonchi, Jens Seeber and Pawel Sobocinski. Graphical Conjunctive Queries

Patrick Baillot and Alexis Ghyselen. Combining Linear Logic and Size Types for Implicit Complexity

Pierre Clairambault and Hugo Paquet. Fully abstract models of the probabilistic lambda-calculus

Faried Abu Zaid, Dietrich Kuskeand Peter Lindner. Climbing up the elementary complexity classes with theories of automatic structures

Aliaume Lopez and Alex Simpson. Basic operational preorders for algebraic effects in general, and for combined probability and nondeterminism in particular

Tor Kawata. A Contextual Reconstruction of Monadic Reflection

Rohit Chadha, A. Prasad Sistla and Mahesh Viswanathan. Approximating Probabilistic Automata

Aurore Alcolei, Pierre Clairambault, Martin Hyland and Glynn Winskel. The True Concurrency of Herbrand's Theorem

Jules Chouquet and Lionel Vaux Auclair. An application of parallel cut elimination in unit-free multiplicative linear logic to the Taylor expansion of proof nets

Anuj Dawar and Gregory Wilsenach. Symmetric Circuits for Rank Logic

Dan Marsden and Maaike Zwart. Quantitative Foundations for Resource Theories

Anupam Das and Damien Pous. Non-wellfounded proof theory for (Kleene+action)(algebras+lattices)

Samson Abramsky and Nihil Shah. Relating Structure and Power: Comonadic Semantics for Computational Resources

Nicolas Basset, Ismaël Jecker, Arno Pauly, Jean-Francois Raskin and Marie Van den Bogaard. Beyond admissibility: Dominance between chains of strategies

Nicolas Behr and Pawel Sobocinski. Rule Algebras for Adhesive Categories

Liron Cohen and Reuben Rowe. Uniform Inductive Reasoning in Transitive Closure Logic via Infinite Descent

Daniel Neider, Alexander Weinert and Martin Zimmermann. Synthesizing Optimally Resilient Controllers

Albert Atserias and Anuj Dawar. Definable Inapproximability: New Challenges for Duplicator

Sven Schewe, Alexander Weinert and Martin Zimmermann. Parity Games with Weights

Benedikt Ahrens, André Hirschowitz, Ambroise Lafont and Marco Maggesi. High-level arities and initial semantics

Flavio Ferrarotti, Jan Van den Bussche and Jonni Virtema. Expressivity within second-order transitive-closure logic

Guy McCusker and Alessio Santamaria. On compositionality of dinatural transformations

W. John Gowers and James Laird. A Fully Abstract Game Semantics for Countable Nondeterminism

Carlo Angiuli, Kuen-Bang Hou and Robert Harper. Cartesian Cubical Computational Type Theory: Constructive Reasoning with Paths and Equalities

Andreas Krebs, Kamal Lodaya, Paritosh Pandya and Howard Straubing. An algebraic decision procedure for two-variable logic with a between relation

Rémi Nollet, Alexis Saurin and Christine Tasson. Local validity for circular proofs in linear logic with fixed points

Anupam Das and Isabel Oitavem. A recursion-theoretic characterisation of the positive polynomial-time functions

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

P. Madhusudan, Umang Mathur, Shambwaditya Saha and Mahesh Viswanathan. A Decidable Fragment of Second Order Logic With Applications to Synthesis

Paul Downen and Zena Ariola. Beyond Polarity: Towards A Multi-Discipline Intermediate Language with Sharing