Abstract is missing.
- A Why-on-Earth Tutorial on Finite Model TheoryAlbert Atserias. 3 [doi]
- The Meaning of SemanticsPrakash Panangaden. 4-5 [doi]
- Logic in Software, Dynamical and Biological SystemsAshish Tiwari. 9-10 [doi]
- Qualitative Tree LanguagesArnaud Carayol, Axel Hadda, Olivier Serre. 13-22 [doi]
- Languages of Dot-Depth One over Infinite WordsManfred Kufleitner, Alexander Lauser. 23-32 [doi]
- Two Views on Multiple Mean-Payoff Objectives in Markov Decision ProcessesTomás Brázdil, Václav Brozek, Krishnendu Chatterjee, Vojtech Forejt, Antonín Kucera. 33-42 [doi]
- Temporal Specifications with Accumulative ValuesUdi Boker, Krishnendu Chatterjee, Thomas A. Henzinger, Orna Kupferman. 43-52 [doi]
- First Steps in Synthetic Guarded Domain Theory: Step-Indexing in the Topos of TreesLars Birkedal, Rasmus Ejlers Møgelberg, Jan Schwinghammer, Kristian Støvring. 55-64 [doi]
- Imperative Programs as Proofs via Game SemanticsMartin Churchill, James Laird, Guy McCusker. 65-74 [doi]
- Game Semantics for Good General ReferencesAndrzej S. Murawski, Nikos Tzevelekos. 75-84 [doi]
- The Computational Meaning of Probabilistic Coherence SpacesThomas Ehrhard, Michele Pagani, Christine Tasson. 87-96 [doi]
- Continuous Random VariablesJean Goubault-Larrecq, Daniele Varacca. 97-106 [doi]
- Noncomputable Conditional DistributionsNathanael Leedom Ackerman, Cameron E. Freer, Daniel M. Roy. 107-116 [doi]
- Propositional Proof Complexity: A Survey on the State of the Art, Including Some Recent ResultsToniann Pitassi. 119 [doi]
- Linear Dependent Types and Relative CompletenessUgo Dal Lago, Marco Gaboardi. 133-142 [doi]
- CoQMTU: A Higher-Order Type Theory with a Predicative Hierarchy of Universes Parametrized by a Decidable First-Order TheoryBruno Barras, Jean-Pierre Jouannaud, Pierre-Yves Strub, Qian Wang. 143-151 [doi]
- Isomorphisms of Types in the Presence of Higher-Order ReferencesPierre Clairambault. 152-161 [doi]
- Listings and LogicsYijia Chen, Jörg Flum. 165-174 [doi]
- Computational Complexity of Quantum SatisfiabilityChristian Herrmann, Martin Ziegler. 175-184 [doi]
- Formalizing Randomized Matching AlgorithmsDai Tri Man Le, Stephen A. Cook. 185-194 [doi]
- Forcing as a Program TransformationAlexandre Miquel. 197-206 [doi]
- Proof Nets for Additive Linear Logic with UnitsWillem Heijltjes. 207-216 [doi]
- Higher-Order Model Checking: From Theory to PracticeNaoki Kobayashi. 219-224 [doi]
- Powermonads and Tensors of Unranked EffectsSergey Goncharov, Lutz Schröder. 227-236 [doi]
- Semantics of Higher-Order Quantum Computation via Geometry of InteractionIchiro Hasuo, Naohiko Hoshino. 237-246 [doi]
- Separation Logic in the Presence of Garbage CollectionChung-Kil Hur, Derek Dreyer, Viktor Vafeiadis. 247-256 [doi]
- Ultrametric Semantics of Reactive ProgramsNeelakantan R. Krishnaswami, Nick Benton. 257-266 [doi]
- Ackermannian and Primitive-Recursive Bounds with Dickson s LemmaDiego Figueira, Santiago Figueira, Sylvain Schmitz, Philippe Schnoebelen. 269-278 [doi]
- The Complexity of Verifying Ground Tree Rewrite SystemsStefan Göller, Anthony Widjaja Lin. 279-288 [doi]
- Complexity of Two-Variable Dependence Logic and IF-LogicJuha Kontinen, Antti Kuusisto, Peter Lohmann, Jonni Virtema. 289-298 [doi]
- The Dichotomy for Conservative Constraint Satisfaction Problems RevisitedLibor Barto. 301-310 [doi]
- A Tetrachotomy for Positive First-Order Logic without EqualityFlorent R. Madelaine, Barnaby Martin. 311-320 [doi]
- Decidability of DefinabilityManuel Bodirsky, Michael Pinsker, Todor Tsankov. 321-328 [doi]
- The Complexity of Evaluating First-Order Sentences over a Fixed StructureAndrei A. Krokhin. 331 [doi]
- Regular Repair of SpecificationsMichael Benedikt, Gabriele Puppis, Cristian Riveros. 335-344 [doi]
- Rigorous Approximated Determinization of Weighted AutomataBenjamin Aminof, Orna Kupferman, Robby Lampert. 345-354 [doi]
- Automata with Group ActionsMikolaj Bojanczyk, Bartek Klin, Slawomir Lasota. 355-364 [doi]
- A Decidable Two-Way Logic on Data WordsDiego Figueira. 365-374 [doi]
- The Ultimate Undecidability Result for the Halpern-Shoham LogicJerzy Marcinkowski, Jakub Michaliszyn. 377-386 [doi]
- What s Decidable about Halpern and Shoham s Interval Logic? The Maximal Fragment ABBLDavide Bresolin, Angelo Montanari, Pietro Sala, Guido Sciavicco. 387-396 [doi]
- Computing Optimal Coverability Costs in Priced Timed Petri NetsParosh Aziz Abdulla, Richard Mayr. 399-408 [doi]
- Concurrent StrategiesSilvain Rideau, Glynn Winskel. 409-418 [doi]