A Machine-Checked Proof of the Odd Order Theorem
Open accessThe DOI matches its Crossref record; 20 of the 20 references it cites were found in a registry or an index.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Character theory of finite groups
(1999) · Choice Reviews Online · doi:10.5860/choice.36-6326a · Cited by 2,187
A Decision Method for Elementary Algebra and Geometry
Tarski, A. (1998) · Texts and Monographs in Symbolic Computation · doi:10.1007/978-3-7091-9459-1_3 · Cited by 1,643
Klein, G., Elphinstone, K., Heiser, G., Andronick, J., Cock, D., Derrin, P., Elkaduwe, D., Engelhardt, K., Kolanski, R., Norrish, M., et al. (2009) · Proceedings of the ACM SIGOPS 22nd symposium on Operating systems principles · doi:10.1145/1629575.1629596 · Cited by 1,633
Interactive Theorem Proving and Program Development
Bertot, Y., & Castéran, P. (2004) · Texts in Theoretical Computer Science An EATCS Series · doi:10.1007/978-3-662-07964-5 · Cited by 1,353
Self-citationEvery planar map is four colorable
Appel, K., & Haken, W. (1976) · Bulletin of the American Mathematical Society · doi:10.1090/s0002-9904-1976-14122-5 · Cited by 1,109
Castéran, P., & Bertot, Y. (2004) · HAL (Le Centre pour la Communication Scientifique Directe) · Cited by 1,084
Self-citationCoquand, T., & Huet, G. (1988) · Information and Computation · doi:10.1016/0890-5401(88)90005-3 · Cited by 1,082
Formalising Java’s Data Race Free Guarantee
Aspinall, D., & Ševčík, J. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-74591-4_4 · Cited by 754
Formal certification of a compiler back-end or: programming a compiler with a proof assistant
Leroy, X. (2006) · Conference record of the 33rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages · doi:10.1145/1111037.1111042 · Cited by 661
Formal Proof—The Four- Color Theorem
Gonthier, G. (2008) · Cited by 601
Self-citationSOLVABILITY OF GROUPS OF ODD ORDER
Feit, W., & Thompson, J. G. (2012) · Cited by 385
Coquand, T., & Paulin-Mohring, C. (1990) · Lecture notes in computer science · doi:10.1007/3-540-52335-9_47 · Cited by 287
A Small Scale Reflection Extension for the Coq system
Gonthier, G., Mahboubi, A., & ̃Tassi, E. (2008) · HAL · Cited by 218
Self-citationAn introduction to small scale reflection in Coq
Gonthier, G., & Mahboubi, A. (2010) · HAL · doi:10.6092/issn.1972-5787/1979 · Cited by 144
Self-citationFormal certification of a compiler back-end or
Leroy, X. (2006) · ACM SIGPLAN Notices · doi:10.1145/1111320.1111042 · Cited by 122
Asperti, A., & Ricciotti, W. (2012) · Cited by 110
Self-citationAvigad, J. D., & Harrison, J. (2014) · Communications of the ACM · doi:10.1145/2591012 · Cited by 105
Self-citationAn Executable Semantics for CompCert C
Campbell, B. K. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-35308-6_8 · Cited by 80
Hinze, R. (2003) · The Fun of Programming · doi:10.1007/978-1-349-91518-7_12 · Cited by 68
A Formal Quantifier Elimination for Algebraically Closed Fields
Cohen, C., & Mahboubi, A. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-14128-7_17 · Cited by 15
Self-citation
Cited by
A FORMAL PROOF OF THE KEPLER CONJECTURE
HALES, T., ADAMS, M., BAUER, G., DANG, T. D., HARRISON, J., HOANG, L. T., KALISZYK, C., MAGRON, V., MCLAUGHLIN, S., NGUYEN, T. T., et al. (2017) · Forum of Mathematics, Pi · doi:10.1017/fmp.2017.1 · Cited by 342
Self-citationThe Role of the Mizar Mathematical Library for Interactive Proof Development in Mizar
Bancerek, G., Byliński, C., Grabowski, A., Korniłowicz, A., Matuszewski, R., Naumowicz, A., & Pąk, K. (2018) · Journal of Automated Reasoning · doi:10.1007/s10817-017-9440-6 · Cited by 204
“Gonthier’s formalization of the Feit–Thompson theorem [25]) as well as in formal computer science (e.”
History of Interactive Theorem Proving
Harrison, J., Urban, J., & Wiedijk, F. (2014) · Handbook of the History of Logic · doi:10.1016/b978-0-444-51624-4.50004-6 · Cited by 107
INT: An Inequality Benchmark for Evaluating Generalization in Theorem Proving
Wu, Y., Jiang, A. Q., Ba, J., & Grosse, R. (2020) · arXiv · doi:10.48550/arxiv.2007.02924 · Cited by 30
Maintaining a Library of Formal Mathematics
van Doorn, F., Ebner, G., & Lewis, R. Y. (2020) · Lecture Notes in Computer Science · doi:10.1007/978-3-030-53518-6_16 · Cited by 29
Metadata
- Authors
- Gonthier, G., Asperti, A., Avigad, J., Bertot, Y., Cohen, C., Garillot, F., Le Roux, S., Mahboubi, A., O’Connor, R., Ould Biha, S., Pasca, I., Rideau, L., Solovyev, A., Tassi, E., & Théry, L.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2013
- Pages
- 163-179
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W1768814311
- Cited by
- 290
- References
- 20
- FWCI
- 19.95
- Type
- conference paper
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.