Separating Rank Logic from Polynomial Time – Moritz Lichter  (KLEENE AWARD)

Inapproximability of Unique Games in Fixed-Point Logic with Counting – Jamie Tucker-Foltz  (KLEENE AWARD)

Multi-Structural Games and Number of Quantifiers – Ronald Fagin, Jonathan Lenchner, Kenneth W. Regan and Nikhil Vyas

Towards a more efficient approach for the satisfiability of two-variable logic – Ting-Wei Lin, Chia-Hsuan Lu and Tony Tan

Initial limit Datalog: a new extensible class of decidable constrained Horn clauses – Toby Cathcart Burn, Luke Ong, Steven Ramsay and Dominik Wagner

Finite Model Theory of the Triguarded Fragment and Related Logics –  Emanuel Kieronski and Sebastian Rudolph

• The Laplace Mechanism is optimal for differential privacy over continuous queries - Annabelle McIver, Natasha Fernandes and Carroll Morgan 
• Deciding Differential Privacy for Programs with Unbounded Inputs - Rohit Chadha, A. Prasad Sistla and Mahesh Viswanathan      
• Quantitative and Approximate Monitoring - Thomas A. Henzinger and N. Ege Saraç        
• Alignment Completeness for Relational Hoare Logics - Ramana Nagasamudram and David Naumann        
• Session Logical Relations for Noninterference - Farzaneh Derakhshan, Stephanie Balzer and Limin Jia  
• A Bunched Logic for Conditional Independence -  Jialu Bao, Simon Docherty, Justin Hsu and Alexandra Silva 

• Minimal Taylor Algebras as a Common Framework for the Three Algebraic Approaches to the CSP - Libor Barto, Zarathustra Brady, Andrei Bulatov, Marcin Kozik and Dmitriy Zhuk (Distinguished Paper)
• No-Rainbow Problem and the Surjective Constraint Satisfaction Problem - Dmitriy Zhuk,
• PTAS for Sparse General-Valued CSPs - Balázs F. Mezei, Marcin Wrochna and Stanislav Živný.
• Constraint Satisfaction Problems over Finite Structures - Libor Barto, William De Meo and Antoine Mottet
• On Logics and Homomorphism Closure - Manuel Bodirsky, Thomas Feller, Simon Knäuer and Sebastian Rudolph         
• Canonical Polymorphisms of Ramsey Structures and the Unique Interpolation Property - Manuel Bodirsky and Bertalan Bodor, 

• The undecidability of System F typability and type checking for reductionists - Andrej Dudenhefner 
• Higher lenses - Paolo Capriotti, Nils Anders Danielsson and Andrea Vezzosi  
• Internal -categorical models of dependent type theory: towards 2LTT eating HoTT - Nicolai Kraus 
• Types are internal infinity-groupoids - Antoine Allioux, Eric Finster and Matthieu Sozeau 
• Normalization for Cubical type theory - Jonathan Sterling and Carlo Angiuli 
• Parametricity and semi-cubical types - Hugo Moeneclaey 

• Compositional Semantics for Probabilistic Programs with Exact Conditioning - Dario Stein and Sam Staton (Distinguished Paper)
• From Multisets over Distributions to Distributions over Multisets - Bart Jacobs 
• Combining nondeterminism, probability, and termination: equational and metric reasoning - Matteo Mio, Ralph Sarkis and Valeria Vignudelli 
• Commutative Monads for Probabilistic Programming Languages - Xiaodong Jia, Bert Lindenhovius, Michael Mislove and Vladimir Zamdzhiev    
• Symbolic Time and Space Tradeoffs for Probabilistic Verification - Krishnendu Chatterjee, Wolfgang Dvořák, Monika Henzinger and Alexander Svozil 
• Stochastic Processes with Expected Stopping Time - Krishnendu Chatterjee and Laurent Doyen 

Orbit-Finite-Dimensional Vector Spaces and Weighted Register Automata - Mikołaj Bojańczyk, Bartek Klin and Joshua Moerman (Distinguished Paper)
Parikh's theorem for infinite alphabets - Piotr Hofman, Marta Juzepczuk, Sławomir Lasota and Mohnish Pattathurajan 
Continuous One-Counter Automata - Michael Blondin, Tim Leys, Filip Mazowiecki, Philip Offtermatt and Guillermo Perez 
From Finite-Valued Nondeterministic Transducers to Deterministic Two-Tape Automata - Elisabet Burjons, Fabian Frei and Martin Raszyk 
SD-Regular Transducer Expressions for Aperiodic Transformations - Luc Dartois, Paul Gastin and Shankara Narayanan Krishna   

• A Constructive Logic with Classical Proofs and Refutations - Pablo Barenbaum and Teodoro Freund    
• Combinatorial Proofs and Decomposition Theorems for First-order Logic - Dominic Hughes, Lutz Straßburger and Jui-Hsuan Wu   
• Decidability and Complexity in Weakening and Contraction Hypersequent Substructural Logics - A. R. Balasubramanian, Timo Lang and Revantha Ramanayake 
• Gödel-McKinsey-Tarski and Blok-Esakia for Lewis-Brouwer Implication - Jim de Groot, Tadeusz Litak and Dirk Pattinson 
• On sequentiality and well-bracketing in the π-calculus - Daniel Hirschkoff, Enguerrand Prebet and Davide Sangiorgi 
• Axiomatizations and Computability of Weighted Monadic Second-Order Logic - Antonis Achilleos and Mathias Ruggaard Pedersen 

• Lacon- and Shrub-Decompositions: A New Characterization of First-Order Transductions of Bounded Expansion Classes - Jan Dreier (Distinguished Paper)  
• Positive first-order logic on words - Denis Kuperber (Distinguished Paper)  
• On the Expressive Power of Homomorphism Counts - Albert Atserias, Phokion Kolaitis and Wei-Lin Wu   
• Forbidden Induced Subgraphs and the Los-Tarski Theorem - Yijia Chen and Jörg Flum 
• Parameterized Complexity of  Elimination Distance to First-Order Logic Properties - Fedor Fomin, Petr Golovach and Dimitrios Thilikos   
• An Algebraic Characterisation of First-Order Logic with Neighbour - Amaldev Manuel and Dhruv Nevatia 

• A Logic for Locally Complete Abstract Interpretations - Roberto Bruni, Roberto Giacobazzi, Roberta Gori and Francesco Ranzato (Distinguished Paper)
• Efficient Local Computation of Differential Bisimulations via Coupling and Up-to Methods - Giorgio Bacci, Giovanni Bacci, Kim Guldstrand Larsen, Mirco Tribastone, Max Tschaikowski and Andrea Vandin 
• A Complete Axiomatization for Divergence Preserving Branching Congruence of Finite-State Behaviours - Xinxin Liu and Tingting Yu     
• Verifying higher-order concurrency with data automata - Alex Dixon, Ranko Lazic, Andrzej Murawski and Igor Walukiewicz 
• Compositional relational reasoning via operational game semantics - Guilhem Jaber and Andrzej Murawski 
• Demonic Lattices and Semilattices in Relational Semigroups with Ordinary Composition - Robin Hirsch and Jas Semrl 

• Graphical Language with Delayed Trace: Picturing Quantum Computing with Finite Memory - Titouan Carette, Simon Perdrix and Marc De Visme 
• A Quantum Interpretation of Bunched Logic & Quantum Separation Logic - Li Zhou, Gilles Barthe, Justin Hsu, Mingsheng Ying and Nengkun Yu    
• A Normal Form Characterization for Efficient Boolean Skolem Function Synthesis - Preey Shah, Aman Bansal, S. Akshay and Supratik Chakraborty 

• Fusible numbers and Peano Arithmetic - Jeff Erickson, Gabriel Nivasch and Junyan Xu (Distinguished Paper)
• Universal Skolem Sets - Florian Luca, Joel Ouaknine and James Worrell (Distinguished Paper)
• Fixed-Points for Quantitative Equational Logics - Radu Mardare, Gordon Plotkin and Prakash Panangaden    
• Global Optimisation with Constructive Reals - Dan Ghica and Todd Waugh Ambridge    
• Monomial-size vs. Bit-complexity in Sums-of-Squares and Polynomial Calculus - Tuomas Hakoniemi 
• First-Order Reasoning and Efficient Semi-Algebraic Proofs - Fedor Part, Neil Thapen and Iddo Tzameret 

Removing Redundant Refusals: Minimal Complete Test Suites for Failure Trace Semantics - Maciej Gazda and Rob Hierons
Responsibility and verification: Importance value in temporal logics - Corto Mascle, Christel Baier, Florian Funke, Simon Jantsch and Stefan Kiefer
Perspective Multi-Player Games - Orna Kupferman and Noam Shenwald
Asynchronous extensions of HyperLTL - Laura Bozzelli, Adriano Peron and Cesar Sanchez
A distributed operational view of Reversible Prime Event Structures - Hernán Melgratti, Claudio Antares Mezzina and G. Michele Pinna  

• Smart choices and the selection monad - Martin Abadi and Gordon Plotkin.
• Assuming just enough fairness to make session types complete for lock-freedom - Rob van Glabbeek, Peter Höfner and Ross Horne.
• A Unifying Framework Broadening Realizability Models - Liron Cohen, Étienne Miquey and Ross Tate. Evidenced Frames:
• Intersection Type Distributors - Federico Olimpieri
• Categorical models of Linear Logic with fixed points of formulas - Thomas Ehrhard and Farzad Jafarrahmani
• On the logical structure of choice and bar induction principles - Nuria Brede and Hugo Herbelin. Nuria Brede and Hugo Herbelin

Expressivity of Quantitative Modal Logics: Categorical Foundations via Codensity and Approximation - Yuichi Komorida, Shin-Ya Katsumata, Clemens Kupke, Jurriaan Rot and Ichiro Hasuo 
The Topological Mu-Calculus: completeness and decidability - Alexandru Baltag, Nick Bezhanishvili and David Fernández-Duque 
Zero-one laws for provability logic: Axiomatizing validity in almost all models and almost all frames - Rineke Verbrugge 
Definitions and Interpolants in the Guarded and Two-Variable Fragments - Jean Christoph Jung and Frank Wolter Living without Beth and Craig 
Some constructive variants of S4 with the finite model property - Philippe Balbiani, Martín Diéguez and David Fernández-Duque 
Behavioural Preorders via Graded Monads - Chase Ford, Stefan Milius and Lutz Schröder 
 

• Comonadic semantics for guarded fragments - Samson Abramsky and Daniel Marsden
• Lovász-type Theorems and Game Comonads - Anuj Dawar, Tomáš Jakl and Luca Reggio    
• The smash product of monoidal theories - Amar Hadzihasanovic    
• Categories of Nets - John Baez, Fabrizio Romano Genovese, Jade Master and Michael Shulman    
• Asynchronous Template Games - Paul-André Melliès 
• On Monadic Rewriting Systems, Part I - Francesco Gavazzo and Claudia Faggian