A formally verified proof of the prime number theorem
From MaRDI portal
Publication:5277791
DOI10.1145/1297658.1297660zbMath1367.68244arXivcs/0509025OpenAlexW2000062667WikidataQ55899223 ScholiaQ55899223MaRDI QIDQ5277791
No author found.
Publication date: 12 July 2017
Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/cs/0509025
Related Items
A heuristic prover for real inequalities ⋮ Decidability of Univariate Real Algebra with Predicates for Rational and Integer Powers ⋮ A decision procedure for linear ``big O equations ⋮ And so on \dots : reasoning with infinite diagrams ⋮ Unnamed Item ⋮ A Relation-Algebraic Treatment of the Dedekind Recursion Theorem ⋮ Extending a Resolution Prover for Inequalities on Elementary Functions ⋮ Proof pearl: Bounding least common multiples with triangles ⋮ A mechanized proof of the basic perturbation lemma ⋮ The Isabelle Framework ⋮ Proof Verification Technology and Elementary Physics ⋮ Nine Chapters of Analytic Number Theory in Isabelle/HOL. ⋮ Parsing and Disambiguation of Symbolic Mathematics in the Naproche System ⋮ A formalization of multi-tape Turing machines ⋮ Finite Groups Representation Theory with Coq ⋮ About the Formalization of Some Results by Chebyshev in Number Theory ⋮ Social processes, program verification and all that
Uses Software
