About the formalization of some results by chebyshev in number theory

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5497 LNCS, Issue , 2009, Pages 19-31

  Asperti, Andrea ^a   Ricciotti, Wilmer ^a  

^a Dipartimento di Scienze dell'Informazione   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

BERTRAND; CHEBYSHEV; INTERACTIVE THEOREM PROVER; KNOWLEDGE BASE; MODERN DEVELOPMENT; PRIME NUMBER;

KNOWLEDGE BASED SYSTEMS; MACHINERY; THEOREM PROVING;

NUMBER THEORY;

EID: 68749096203     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-02444-3_2     Document Type: Conference Paper

References (11)

1. Apostol, T.M.: Introduction to Analytic Number Theory. Springer, Heidelberg (1976)
2. Asperti, A., Armentano, C.: A Page In Number Theory. Journal of Formalized Reasoning 1 (2008) (to appear)
3. Avigad, J., Donnelly, K., Gray, D., Raff, P.: A formally verified proof of the prime number theorem. ACM Transactions on Computational Logic 9(1) (2007) (to appear in the ACM Transactions on Computational Logic)
4. Erdös, P.: Beweis eines Satzes von Tschebyschef. Acta Scientifica Mathematica 5, 194-198 (1932)
5. Harrison, J.: Formalizing an analytic proof of the Prime Number Theorem (extended abstract). In: Participant's proceedings of TTVSI Festschrift in honour of Mike Gordon's 60th birthday (2008)
6. Jameson, G.J.O.: The Prime Number Theorem. London Mathematical Society Student Texts, vol. 53. Cambridge University Press, Cambridge (2003)
7. Hardy, G.H., Wright, E.M.: An introduction to the theory of numbers. Oxford University Press, Oxford (1938) (Fourth edition 1975)
8. Riccardi, M.: Pocklington's Theorem and Bertrand's Postulate. Formalized Mathematics 14(2), 47-52 (2006)
9. Sacerdoti Coen, C., Tassi, E.: A constructive and formal proof of Lebesgues Dominated Convergence Theorem in the interactive theorem prover Matita. Journal of Formalized Reasoning 1(1), 51-89 (2008)
10. Tenenbaum, G., Mendès France, M.: The Prime Numbers and Their Distribution. Student Mathematical Library. American Mathematical Society (2000)
11. Théry, L.: Proving Pearl: Knuth's Algorithm for Prime Numbers. In: Basin, D., Wolff, B. (eds.) TPHOLs 2003. LNCS, vol. 2758, pp. 304-318. Springer, Heidelberg (2003)