About the Formalization of Some Results by Chebyshev in Number Theory

DOI10.1007/978-3-642-02444-3_2MaRDI QIDQ3638243zbMATH OpenOpenAlexFDO

Authors Andrea Asperti, Wilmer Ricciotti

Publication date 2 July 2009

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-02444-3_2

Mathematics Subject Classification ID

Mechanization of proofs and logical operations (03B35) Primes (11A41)

Recommendations

• scientific article; zbMATH DE number 7106484
• Formalizing an analytic proof of the prime number theorem
• A formally verified proof of the prime number theorem
• A Short Proof of Chebyshev's Theorem
• scientific article; zbMATH DE number 3004464

Cites work

• scientific article; zbMATH DE number 5587007 (Why is no real title available?)
• scientific article; zbMATH DE number 3523640 (Why is no real title available?)
• scientific article; zbMATH DE number 1822311 (Why is no real title available?)
• scientific article; zbMATH DE number 3032896 (Why is no real title available?)
• A constructive and formal proof of Lebesgue's dominated convergence theorem in the interactive theorem prover Matita
• A formally verified proof of the prime number theorem
• Proving pearl: Knuth's algorithm for prime numbers

Cited in

(5)

• Proof pearl: Bounding least common multiples with triangles
• Social processes, program verification and all that
• Formalizing an analytic proof of the prime number theorem
• A compact kernel for the calculus of inductive constructions
• The Matita interactive theorem prover

Describes a project that uses

Uses Software

• Matita

This page was built for publication: About the Formalization of Some Results by Chebyshev in Number Theory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3638243)