A formally verified proof of the prime number theorem

ACM Transactions on Computational Logic

Volumn 9, Issue 1, 2007, Pages

  Avigad, Jeremy ^a   Donnelly, Kevin ^b   Gray, David ^a   Raff, Paul ^c  

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b BOSTON UNIVERSITY   (United States)

^c RUTGERS UNIVERSITY   (United States)

Author keywords

Formal verification; Prime number theorem

Indexed keywords

COMPLEX ANALYSIS; FORMAL VERIFICATION; PRIME NUMBER THEOREM; SELBERG'S PROOF;

ASYMPTOTIC ANALYSIS; FORMAL LOGIC; INTEGER PROGRAMMING; LARGE SCALE SYSTEMS; THEOREM PROVING;

NUMBER THEORY;

EID: 37049032802     PISSN: 15293785     EISSN: 1557945X     Source Type: Journal    
DOI: 10.1145/1297658.1297660     Document Type: Article

References (16)

1. APOSTOL, T. M. 1976. Introduction to Analytic Number Theory. Springer-Verlag.
2. AVIGAD, J. 2003. Number theory and elementary arithmetic. Philosophia Mathematica 11, 257-284.
3. AVIGAD, J. 2004. Notes on a formalization of the prime number theorem. Tech. rep. CMU-PHIL-163, Carnegie Mellon University.
4. AVIGAD, J. AND DONNELLY, K. 2004. Formalizing O notation in Isabelle/HOL. In Proceedings of the 2nd International Joint Conference on Automated Reasoning (IJCAR), D. Basin and M. Rusinowitch, Eds. vol. 3097, Lecture Notes in Artificial Intelligence, Springer-Verlag, 357-371.
5. AVIGAD, J. AND FRIEDMAN, H. 2006. Combining decision procedures for the reals. Logic. Meth. Comput. Sci. 2,(4:4), 1-42.
6. CORNAROS, C. AND DIMITRACOPOULOS, C. 1994. The prime number theorem and fragments of PA. Arch. Math. Logic 33, 4, 265-281.
7. EDWARDS, H. M. 2001. Riemann's Zeta Function. Dover Publications Inc., Mineola, NY.
8. HARDY, G. H. AND WRIGHT, E. M. 1979. An Introduction to the Theory of Numbers, 5th Ed. Oxford University Press, New York.
9. JAMESON, G. J. O. 2003. The Prime Number Theorem. London Mathematical Society Student Texts, vol. 53. Cambridge University Press, Cambridge, UK.
10. MCLAUGHLIN, S. AND HARRISON, J. 2005. A proof producing decision procedure for real arithmetic. In Proceedings of the Automated Deduction-CADE-20. 20th International Conference on Automated Deduction (CADE '20). Tallinn, Estonia, R. Nieuwenhuis, Ed. Lecture Notes in Artificial Intelligence, vol. 3632, 295-314.
11. NATHANSON, M. B. 2000. Elementary Methods in Number Theory. Springer-Verlag.
12. NIPKOW, T., PAULSON, L. C., AND WENZEL, M. 2002. Isabelle/HOL. A proof assistant for higher-order logic. Lecture Notes in Computer Science, vol. 2283. Springer-Verlag.
13. SHAPIRO, H. N. 1983. Introduction to the Theory of Numbers. Pure and Applied Mathematics. John Wiley & Sons Inc.
14. WENZEL, M. 1997. Type classes and overloading in higher-order logic. In Proceedings of the 10th International Conference on Theorem Proving in Higher Order Logics (TPHOLs), E. Gunter and A. Felty, Eds. NJ, 307-322.
15. WENZEL, M. 2002. Isabelle/isar - a versatile environment for human-readable formal proof documents. Ph.D. thesis, Institut für Informatik, Technische Universität München.
16. WIEDIJK, F. 2006. The Seventeen Provers of the World. Springer-Verlag.