About the Formalization of Some Results by Chebyshev in Number Theory

DOI10.1007/978-3-642-02444-3_2zbMath1246.03026OpenAlexW2122761321MaRDI QIDQ3638243

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)

Related Items

Proof pearl: Bounding least common multiples with triangles, The Matita Interactive Theorem Prover, Social processes, program verification and all that, A compact kernel for the calculus of inductive constructions

Uses Software

• Matita

Cites Work

• Proving Pearl: Knuth’s Algorithm for Prime Numbers
• A formally verified proof of the prime number theorem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item