About the Formalization of Some Results by Chebyshev in Number Theory

DOI10.1007/978-3-642-02444-3_2zbMATH Open1246.03026OpenAlexW2122761321MaRDI QIDQ3638243FDOQ3638243

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

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

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A formally verified proof of the prime number theorem
• A constructive and formal proof of Lebesgue's dominated convergence theorem in the interactive theorem prover Matita
• Proving pearl: Knuth's algorithm for prime numbers
• Title not available (Why is that?)

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

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)