Type Classes and Overloading in Higher-Order Logic
TPHOLs '97 Proceedings of the 10th International Conference on Theorem Proving in Higher Order Logics
The Seventeen Provers of the World: Foreword by Dana S. Scott (Lecture Notes in Computer Science / Lecture Notes in Artificial Intelligence)
Isabelle/HOL: a proof assistant for higher-order logic
Isabelle/HOL: a proof assistant for higher-order logic
A proof-producing decision procedure for real arithmetic
CADE' 20 Proceedings of the 20th international conference on Automated Deduction
Implementing the cylindrical algebraic decomposition within the Coq system
Mathematical Structures in Computer Science
A Decision Procedure for Linear "Big O" Equations
Journal of Automated Reasoning
A Mechanized Proof of the Basic Perturbation Lemma
Journal of Automated Reasoning
TPHOLs '08 Proceedings of the 21st International Conference on Theorem Proving in Higher Order Logics
About the Formalization of Some Results by Chebyshev in Number Theory
Types for Proofs and Programs
Social processes, program verification and all that
Mathematical Structures in Computer Science
Extending a resolution prover for inequalities on elementary functions
LPAR'07 Proceedings of the 14th international conference on Logic for programming, artificial intelligence and reasoning
A modular formalisation of finite group theory
TPHOLs'07 Proceedings of the 20th international conference on Theorem proving in higher order logics
Source-level proof reconstruction for interactive theorem proving
TPHOLs'07 Proceedings of the 20th international conference on Theorem proving in higher order logics
Some considerations on the usability of interactive provers
AISC'10/MKM'10/Calculemus'10 Proceedings of the 10th ASIC and 9th MKM international conference, and 17th Calculemus conference on Intelligent computer mathematics
Parsing and disambiguation of symbolic mathematics in the Naproche system
MKM'11 Proceedings of the 18th Calculemus and 10th international conference on Intelligent computer mathematics
An interpretation of Isabelle/HOL in HOL light
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
Proof, message and certificate
CICM'12 Proceedings of the 11th international conference on Intelligent Computer Mathematics
| Hi-index | 0.00 |
The prime number theorem, established by Hadamard and de la Vallée Poussin independently in 1896, asserts that the density of primes in the positive integers is asymptotic to 1/ln x. Whereas their proofs made serious use of the methods of complex analysis, elementary proofs were provided by Selberg and Erdös in 1948. We describe a formally verified version of Selberg's proof, obtained using the Isabelle proof assistant.