| 2017 | Noetherian Quasi-Polish spaces. | Matthew de Brecht, Arno Pauly |
| 2017 | A Decidable Intuitionistic Temporal Logic. | Joseph Boudou, Martn Diguez, David Fernndez-Duque |
| 2017 | Decidable Logics with Associative Binary Modalities. | Joseph Boudou |
| 2017 | Stone Duality and the Substitution Principle. | Clia Borlido, Silke Czarnetzki, Mai Gehrke, Andreas Krebs |
| 2017 | On the (In)Succinctness of Muller Automata. | Udi Boker |
| 2017 | Extending Two-Variable Logic on Trees. | Bartosz Bednarczyk, Witold Charatonik, Emanuel Kieronski |
| 2017 | Query Learning of Derived Omega-Tree Languages in Polynomial Time. | Dana Angluin, Timos Antonopoulos, Dana Fisman |
| 2017 | Categorical Structures for Type Theory in Univalent Foundations. | Benedikt Ahrens, Peter LeFanu Lumsdaine, Vladimir Voevodsky |
| 2016 | Front Matter, Table of Contents, Preface, Conference Organization, External Reviewers. | |
| 2016 | Easy to Win, Hard to Master: Optimal Strategies in Parity Games with Costs. | Alexander Weinert, Martin Zimmermann |
| 2016 | Robust Linear Temporal Logic. | Paulo Tabuada, Daniel Neider |
| 2016 | Coalgebraic Learning. | Alexandra Silva |
| 2016 | Quine's Fluted Fragment is Non-Elementary. | Ian Pratt-Hartmann, Wieslaw Szwast, Lidia Tendera |
| 2016 | Models of Lambda-Calculus and the Weak MSO Logic. | Pawel Parys, Szymon Torunczyk |
| 2016 | Definability of Cai-Frer-Immerman Problems in Choiceless Polynomial Time. | Wied Pakusa, Svenja Schalthfer, Erkal Selman |
| 2016 | Axioms for Modelling Cubical Type Theory in a Topos. | Ian Orton, Andrew M. Pitts |
| 2016 | Automated Synthesis: Going Distributed. | Anca Muscholl |
| 2016 | Axiomatizations for Propositional and Modal Team Logic. | Martin Lck |
| 2016 | The Matrix Ring of a μ-Continuous Chomsky Algebra is mu-Continuous. | Hans Leiss |
| 2016 | Polymorphic Game Semantics for Dynamic Binding. | James Laird |
| 2016 | Bar Recursion in Classical Realisability: Dependent Choice and Continuum Hypothesis. | Jean-Louis Krivine |
| 2016 | Monadic Second Order Finite Satisfiability and Unbounded Tree-Width. | Tomer Kotek, Helmut Veith, Florian Zuleger |
| 2016 | The Logical Strength of Bchi's Decidability Theorem. | Leszek Aleksander Kolodziejczyk, Henryk Michalewski, Ccilia Pradic, Michal Skrzypczak |
| 2016 | One-Dimensional Logic over Words. | Emanuel Kieronski |
| 2016 | The Height of Piecewise-Testable Languages with Applications in Logical Complexity. | Prateek Karandikar, Philippe Schnoebelen |