A modular formalisation of finite group theory

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

Volumn 4732 LNCS, Issue , 2007, Pages 86-101

  Gonthier, Georges ^a   Mahboubi, Assia ^a   Rideau, Laurence ^b   Tassi, Enrico ^c   Théry, Laurent ^b  

^a MICROSOFT RESEARCH   (United States)

^b INRIA   (France)

^c UNIVERSITY OF BOLOGNA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; THEOREM PROVING;

ELEMENTARY GROUP THEORY; FINITE GROUP THEORY;

ARTIFICIAL INTELLIGENCE;

EID: 38049031798     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-74591-4_8     Document Type: Conference Paper

References (23)

1. Arthan, R.: Some group theory, available at http://www.lemma-one.com/ ProofPower/examples/wrk068.pdf
2. Avigad, J., Donnelly, K., Gray, D., Raff, P.: A Formally Verified Proof of the Prime Number Theorem. ACM Transactions on Computational Logic (to appear)
3. Bailey, A.: Representing algebra in LEGO. Master's thesis, University of Edinburgh (1993)
4. Barthe, G., Capretta, V., Pons, O.: Setoids in type theory. Journal of Functional Programming 13(2), 261-293 (2003)
5. Bender, H., Glauberman, G.: Local analysis for the Odd Order Theorem. London Mathematical Society Lecture Note Series, vol. 188. Cambridge University Press, Cambridge (1994)
6. Constantine, G.M.: Group Theory, available at http://www.pitt.edu/~gmc/ algsyl.html
7. Feit, W., Thompson, J.G.: Solvability of groups of odd order. Pacific Journal of Mathematics 13(3), 775-1029 (1963)
8. Geuvers, H., Wiedijk, F., Zwanenburg, J.: A Constructive Proof of the Fundamental Theorem of Algebra without Using the Rationals. In: Callaghan, P., Luo, Z., McKinna, J., Pollack, R. (eds.) TYPES 2000. LNCS, vol. 2277, pp. 96-111. Springer, Heidelberg (2002)
9. Gonthier, G.: A computer-checked proof of the four-colour theorem, available at http://research.microsoft.com/~gonthier/4colproof.pdf
10. Gonthier, G.: Notations of the four colour theorem proof, available at http://research.microsoft.com/~gonthier/4colnotations.pdf
11. Gordon, M.J.C., Melham, T.F.: Introduction to HOL: a theorem proving environment for higher-order logic. Cambridge University Press, Cambridge (1993)
12. Gunter, E.: Doing Algebra in Simple Type Theory. Technical Report MS-CIS-89-38, University of Pennsylvania (1989)
13. Kammüller, F., Paulson, L.C.: A Formal Proof of Sylow's Theorem. Journal of Automating Reasoning 23(3-4), 235-264 (1999)
14. The Coq development team: The Coq proof assistant reference manual. LogiCal Project, Version 8.1 (2007)
15. The Mizar Home Page, http://www.mizar.org/
16. Paulin-Mohring, C.: Définitions Inductives en Théorie des Types d'Ordre Supérieur. Habilitation à diriger les recherches, Université Claude Bernard Lyon I (December 1996)
17. Paulson, L.C. (ed.): Isabelle. LNCS, vol. 828. Springer, Heidelberg (1994)
18. Peterfalvi, T.: Character Theory for the Odd Order Theorem. London Mathematical Society Lecture Note Series, vol. 272. Cambridge University Press, Cambridge (2000)
19. The Flyspeck Project, http://www.math.pitt.edu/~thales/flyspeck/
20. Rideau, L., Théry, L.: Formalising Sylow's theorems in Coq. Technical Report 0327, INRIA (2006)
21. Werner, B.: Une théorie des Constructions Inductives. PhD thesis, Paris 7 (1994)
22. Wielandt, H.: Ein beweis für die Existenz der Sylowgruppen. Archiv der Mathematik 10, 401-402 (1959)
23. Yu, Y.: Computer Proofs in Group Theory. J. Autom. Reasoning 6(3), 251-286 (1990)