The field of Weak Arithmetics concerns the application of logical methods to Number Theory, developed by mathematicians, philosophers, and theoretical computer scientists.
This third volume in this collection contains nine substantive papers based on lectures delivered during two last meetings of the conference series JAF (Journées sur les Arithmétiques Faibles) which took place in 2014 at the University of Gothenburg, Sweden and in 2015 at the CUNY Graduate Center, New York, USA.
is Professor at the University Paris-Est Créteil
IUT Sénart Fontainebleau, France. is Professor at the University of Gothenburg, Sweden. is Professor at the City University of New York, USA.
Patrick Cégielski, Ali Enayat, Roman Kossak
- 1 Flexibility in Fragments of Peano Arithmetic
- 2 On the Diaphantine Complexity of the Set of Prime Numbers
Pietro Corvaja, Eugenio Omodeo, Luca Vallata
- 3 Δ0–Definability of Dedekind Sums
- 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
- 7 Submodel Lattices of Existentially Closed Models of Arithmetic
James H. Schmerl
- 8 Towards an Effective Theory of Absolutely Continuous Measures
- 9 Notes on Various Versions of Friedman's Self-Embedding Theorem
September 28, 2016