Cover
Title
Copyright
Contents
Contributors
Introduction - Patrick Cégielski, Ali Enayat, Roman Kossak
1. Flexibility in Fragments of Peano Arithmetic - Rasmus Blanck
2. On the Diophantine Complexity of the Set of Prime Numbers - Pietro Corvaja, Eugenio Omodeo, Luca Vallata
3. ∆0—Definability of Dedekind Sums - Henri-Alex Esbelin
4. Characterizations of Interpretability in Bounded Arithmetic - Joost J. Joosten
5. An Imperative Language Characterizing PTIME Algorithms - Yoann Marquer and Pierre Valarcher
6. Near-Linearity and Open Induction - Mojtaba Moniri
7. Submodel Lattices of Existentially Closed Models of Arithmetic - James H. Schmerl
8. Towards an Effective Theory of
Absolutely Continuous Measures - Henry Towsner
9. Notes on Various Versions of
Friedman's Self-Embedding
Theorem - Keita Yokoyama