| 2020 | A characterisation of ordered abstract probabilities. | Abraham Westerbaan, Bas Westerbaan, John van de Wetering |
| 2020 | Constructing Higher Inductive Types as Groupoid Quotients. | Niels van der Weide |
| 2020 | A Constructive Model of Directed Univalence in Bicubical Sets. | Matthew Z. Weaver, Daniel R. Licata |
| 2020 | Automata Learning: An Algebraic Approach. | Henning Urbat, Lutz Schrder |
| 2020 | On Computability of Logical Approaches to Branching-Time Property Verification of Programs. | Takeshi Tsukada |
| 2020 | Register Automata with Extrema Constraints, and an Application to Two-Variable Logic. | Szymon Torunczyk, Thomas Zeume |
| 2020 | Making Streett Determinization Tight. | Cong Tian, Wensheng Wang, Zhenhua Duan |
| 2020 | Sequential Colimits in Homotopy Type Theory. | Kristina Sojakova, Floris van Doorn, Egbert Rijke |
| 2020 | An Efficient Normalisation Procedure for Linear Temporal Logic and Very Weak Alternating Automata. | Salomon Sickert, Javier Esparza |
| 2020 | Resolving finite indeterminacy: A definitive constructive universal prime ideal theorem. | Peter Schuster, Daniel Misselbeck-Wessel |
| 2020 | Partial Univalence in n-truncated Type Theory. | Christian Sattler, Andrea Vezzosi |
| 2020 | Extended Kripke lemma and decidability for hypersequent substructural logics. | Revantha Ramanayake |
| 2020 | Contextual Types, Explained: Invited Tutorial. | Brigitte Pientka |
| 2020 | Russian Constructivism in a Prefascist Theory. | Pierre-Marie Pdrot |
| 2020 | The Hidden Subgroup Problem for Universal Algebras. | Matthew Moore, Taylor Walenczyk |
| 2020 | Concurrent Separation Logic Meets Template Games. | Paul-Andr Mellis, Lo Stefanesco |
| 2020 | Sparse Hashing for Scalable Approximate Model Counting: Theory and Practice. | Kuldeep S. Meel, S. Akshay |
| 2020 | Pebble Minimization of Polyregular Functions. | Nathan Lhote |
| 2020 | When Reachability Meets Grzegorczyk. | Jrme Leroux |
| 2020 | Good-for-games ω-Pushdown Automata. | Karoliina Lehtinen, Martin Zimmermann |
| 2020 | Coherence via Well-Foundedness: Taming Set-Quotients in Homotopy Type Theory. | Nicolai Kraus, Jakob von Raumer |
| 2020 | Large and Infinitary Quotient Inductive-Inductive Types. | Andrs Kovcs, Ambrus Kaposi |
| 2020 | Refinement-Based Game Semantics for Certified Abstraction Layers. | Jrmie Koenig, Zhong Shao |
| 2020 | Consuming and Persistent Types for Classical Logic. | Delia Kesner, Pierre Vial |
| 2020 | Interaction Laws of Monads and Comonads. | Shin-ya Katsumata, Exequiel Rivas, Tarmo Uustalu |