Abstract is missing.
- The Ackermann Award 2016Thierry Coquand, Anuj Dawar. [doi]
- The Seifert-van Kampen Theorem in Homotopy Type TheoryKuen-Bang Hou (Favonia), Michael Shulman. [doi]
- 0 FunctionsArnaud Durand 0001, Anselm Haak, Juha Kontinen, Heribert Vollmer. [doi]
- Hedging Bets in Markov Decision ProcessesRajeev Alur, Marco Faella, Sampath Kannan, Nimit Singhania. [doi]
- The Height of Piecewise-Testable Languages with Applications in Logical ComplexityPrateek Karandikar, Philippe Schnoebelen. [doi]
- The Logical Strength of Büchi's Decidability TheoremLeszek Aleksander Kolodziejczyk, Henryk Michalewski, Pierre Pradic, Michal Skrzypczak. [doi]
- Guarded Cubical Type Theory: Path Equality for Guarded RecursionLars Birkedal, Ales Bizjak, Ranald Clouston, Hans Bugge Grathwohl, Bas Spitters, Andrea Vezzosi. [doi]
- Infinite Domain Constraint Satisfaction ProblemLibor Barto. [doi]
- AC Dependency Pairs RevisitedAkihisa Yamada 0002, Christian Sternagel, René Thiemann, Keiichirou Kusakari. [doi]
- Axioms for Modelling Cubical Type Theory in a ToposIan Orton, Andrew M. Pitts. [doi]
- Axiomatizations for Propositional and Modal Team LogicMartin Lück. [doi]
- Polymorphic Game Semantics for Dynamic BindingJames Laird. [doi]
- Quine's Fluted Fragment is Non-ElementaryIan Pratt-Hartmann, Wieslaw Szwast, Lidia Tendera. [doi]
- Dependence Logic vs. Constraint SatisfactionLauri Hella, Phokion G. Kolaitis. [doi]
- The Relational Model Is Injective for Multiplicative Exponential Linear LogicDaniel de Carvalho. [doi]
- Quantified Constraint Satisfaction on MonoidsHubie Chen, Peter Mayr. [doi]
- Bar Recursion in Classical Realisability: Dependent Choice and Continuum HypothesisJean-Louis Krivine. [doi]
- Minimizing Regret in Discounted-Sum GamesPaul Hunter, Guillermo A. Pérez, Jean-François Raskin. [doi]
- Coalgebraic LearningAlexandra Silva. [doi]
- Models of Lambda-Calculus and the Weak MSO LogicPawel Parys, Szymon Torunczyk. [doi]
- Analytic Calculi for Non-Classical Logics: Theory and ApplicationsAgata Ciabattoni. [doi]
- Easy to Win, Hard to Master: Optimal Strategies in Parity Games with CostsAlexander Weinert, Martin Zimmermann 0002. [doi]
- Semantics for "Enough-Certainty" and Fitting's Embedding of Classical Logic in S4Gergei Bana, Mitsuhiro Okada. [doi]
- Counting in Team SemanticsErich Grädel, Stefan Hegselmann. [doi]
- The Directed Homotopy HypothesisJérémy Dubut, Eric Goubault, Jean Goubault-Larrecq. [doi]
- Definability of Cai-Fürer-Immerman Problems in Choiceless Polynomial TimeWied Pakusa, Svenja Schalthöfer, Erkal Selman. [doi]
- Monadic Second Order Finite Satisfiability and Unbounded Tree-WidthTomer Kotek, Helmut Veith, Florian Zuleger. [doi]
- Extending Homotopy Type Theory with Strict EqualityThorsten Altenkirch, Paolo Capriotti, Nicolai Kraus. [doi]
- Extracting Non-Deterministic Concurrent ProgramsUlrich Berger. [doi]
- Free-Cut Elimination in Linear Logic and an Application to a Feasible ArithmeticPatrick Baillot, Anupam Das. [doi]
- One-Dimensional Logic over WordsEmanuel Kieronski. [doi]
- Robust Linear Temporal LogicPaulo Tabuada, Daniel Neider. [doi]
- Front Matter, Table of Contents, Preface, Conference Organization, External Reviewers [doi]
- Context-Free Graph Properties via Definable DecompositionsMichael Elberfeld. [doi]
- On the Parallel Complexity of Bisimulation on Finite SystemsMoses Ganardi, Stefan Göller, Markus Lohrey. [doi]
- Automated Synthesis: Going DistributedAnca Muscholl. [doi]
- Non-Homogenizable Classes of Finite StructuresAlbert Atserias, Szymon Torunczyk. [doi]
- The Matrix Ring of a μ-Continuous Chomsky Algebra is mu-ContinuousHans Leiss. [doi]
- Completeness for Coalgebraic Fixpoint LogicSebastian Enqvist, Fatemeh Seifan, Yde Venema. [doi]
- Infinitary Proof Theory: the Multiplicative Additive CaseDavid Baelde, Amina Doumane, Alexis Saurin. [doi]
- Successor-Invariant First-Order Logic on Graphs with Excluded Topological SubgraphsKord Eickmeyer, Ken-ichi Kawarabayashi. [doi]
- High-Quality Synthesis Against Stochastic EnvironmentsShaull Almagor, Orna Kupferman. [doi]
- A Sequent Calculus for a Modal Logic on Finite Data TreesDavid Baelde, Simon Lunel, Sylvain Schmitz. [doi]