1. Ackermann, W. (1940). Zur widerspruchsfreiheit der zahlentheorie. Mathematische Annalen, 117, 162–194.
2. Aschieri, F. (2011a). Learning, realizability and games in classical arithmetic. Ph.D. thesis, Universita degli Studi di Torino and Queen Mary, University of London.
3. Aschieri, F. (2011b). Transfinite update procedures for predicative systems of analysis. In Computer Science Logic (CSL’11) (Volume 12 of Leibniz international proceedings in informatics, pp. 1–15).
4. Aschieri, F., & Berardi, S. (2010). Interactive learning-based realizability for Heyting arithmetic with EM1. Logical Methods in Computer Science, 6(3), 1–22.
5. Avigad, J. (2002). Update procedures and the 1-consistency of arithmetic. Mathematical Logic Quarterly, 48(1), 3–13.