Creative Commons
| Preface Andrei Voronkov | ||
| The succinctness of first-order logic on linear orders | ||
| Martin Grohe and Nicole Schweikardt | ||
| Deciding Quantifier-Free Presburger Formulas Using Parameterized Solution Bounds | ||
| Sanjit A Seshia and Randal E Bryant | ||
| Model Checking Probabilistic Pushdown Automata | ||
| Antonín Kučera, Javier Esparza and Richard Mayr | ||
| Theories for TC0 and Other Small Complexity Classes | ||
| Phuong Nguyen and Stephen Cook | ||
| Automatic Structures: Richness and Limitations | ||
| Bakhadyr Khoussainov, Andre Nies, Sasha Rubin and Frank Stephan | ||