Abstract is missing.
- MLR-low Sequences: A TutorialLaurent Bienvenu, Alexander Shen. 1-23 [doi]
- Horn Clause Solvers for Program VerificationNikolaj Bjørner, Arie Gurfinkel, Kenneth L. McMillan, Andrey Rybalchenko. 24-51 [doi]
- Existential Fixed-Point Logic as a Fragment of Second-Order LogicAndreas Blass. 52-68 [doi]
- On the Unpredictability of Individual Quantum Measurement OutcomesAlastair A. Abbott, Cristian S. Calude, Karl Svozil. 69-86 [doi]
- The Ehrenfeucht-Fraïssé Method and the Planted Clique ConjectureYijia Chen, Jörg Flum. 87-108 [doi]
- Monadic Theory of a Linear Order Versus the Theory of its Subsets with the Lifted Min/Max OperationsChristian Choffrut, Serge Grigorieff. 109-128 [doi]
- Regularity Equals Monadic Second-Order Definability for Quasi-treesBruno Courcelle. 129-141 [doi]
- Capturing MSO with One QuantifierAnuj Dawar, Luc Segoufin. 142-152 [doi]
- Logics for Weighted Timed Pushdown AutomataManfred Droste, Vitaly Perevoshchikov. 153-173 [doi]
- Inherent Vacuity in Lattice AutomataHila Gonen, Orna Kupferman. 174-192 [doi]
- Is Polynomial Time Choiceless?Erich Grädel, Martin Grohe. 193-209 [doi]
- Arithmetical Congruence Preservation: From Finite to InfinitePatrick Cégielski, Serge Grigorieff, Irène Guessarian. 210-225 [doi]
- An Extension of the Ehrenfeucht-Fraïssé Game for First Order Logics Augmented with Lindström QuantifiersSimi Haber, Saharon Shelah. 226-236 [doi]
- Logics of Finite Hankel RankNadia Labai, Johann A. Makowsky. 237-252 [doi]
- The Strategy of CampaigningRohit Parikh, Çagil Tasdemir. 253-260 [doi]
- On Almost Future Temporal LogicsAlexander Rabinovich. 261-272 [doi]
- Minsky Machines and Algorithmic ProblemsMark V. Sapir. 273-292 [doi]
- On Failure of 0-1 LawsSaharon Shelah. 293-296 [doi]
- Composition Over the Natural Number Ordering with an Extra Binary RelationWolfgang Thomas. 297-306 [doi]
- The Fundamental Nature of the Log Loss FunctionVladimir Vovk. 307-318 [doi]