{"id":"https://openalex.org/W1503170941","doi":"https://doi.org/10.1007/978-3-540-87827-8_28","title":"The Four Colour Theorem: Engineering of a Formal Proof","display_name":"The Four Colour Theorem: Engineering of a Formal Proof","publication_year":2008,"publication_date":"2008-01-01","ids":{"openalex":"https://openalex.org/W1503170941","doi":"https://doi.org/10.1007/978-3-540-87827-8_28","mag":"1503170941"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-540-87827-8_28","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-87827-8_28","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5078217586","display_name":"Georges Gonthier","orcid":null},"institutions":[{"id":"https://openalex.org/I4210164937","display_name":"Microsoft Research (United Kingdom)","ror":"https://ror.org/05k87vq12","country_code":"GB","type":"company","lineage":["https://openalex.org/I1290206253","https://openalex.org/I4210164937"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Georges Gonthier","raw_affiliation_strings":["Microsoft Research, Cambridge, England","Microsoft Research,Cambridge, England"],"affiliations":[{"raw_affiliation_string":"Microsoft Research, Cambridge, England","institution_ids":["https://openalex.org/I4210164937"]},{"raw_affiliation_string":"Microsoft Research,Cambridge, England","institution_ids":["https://openalex.org/I4210164937"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5078217586"],"corresponding_institution_ids":["https://openalex.org/I4210164937"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":10.063,"has_fulltext":false,"cited_by_count":116,"citation_normalized_percentile":{"value":0.98776224,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":95,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"333","last_page":"333"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9921000003814697,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9921000003814697,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12504","display_name":"Mathematics and Applications","score":0.9815999865531921,"subfield":{"id":"https://openalex.org/subfields/2608","display_name":"Geometry and Topology"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12170","display_name":"History and Theory of Mathematics","score":0.9635999798774719,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.8374267816543579},{"id":"https://openalex.org/keywords/planarity-testing","display_name":"Planarity testing","score":0.8277957439422607},{"id":"https://openalex.org/keywords/proof-assistant","display_name":"Proof assistant","score":0.7531634569168091},{"id":"https://openalex.org/keywords/automated-theorem-proving","display_name":"Automated theorem proving","score":0.7203530669212341},{"id":"https://openalex.org/keywords/computer-assisted-proof","display_name":"Computer-assisted proof","score":0.705534815788269},{"id":"https://openalex.org/keywords/structural-proof-theory","display_name":"Structural proof theory","score":0.6202526092529297},{"id":"https://openalex.org/keywords/proof-complexity","display_name":"Proof complexity","score":0.6177709698677063},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6097211837768555},{"id":"https://openalex.org/keywords/analytic-proof","display_name":"Analytic proof","score":0.5885533690452576},{"id":"https://openalex.org/keywords/proof-theory","display_name":"Proof theory","score":0.5320084691047668},{"id":"https://openalex.org/keywords/statement","display_name":"Statement (logic)","score":0.5320034623146057},{"id":"https://openalex.org/keywords/property","display_name":"Property (philosophy)","score":0.48945558071136475},{"id":"https://openalex.org/keywords/proofs-of-fermats-little-theorem","display_name":"Proofs of Fermat's little theorem","score":0.4652017056941986},{"id":"https://openalex.org/keywords/formal-proof","display_name":"Formal proof","score":0.45540720224380493},{"id":"https://openalex.org/keywords/natural-deduction","display_name":"Natural deduction","score":0.44283366203308105},{"id":"https://openalex.org/keywords/calculus","display_name":"Calculus (dental)","score":0.43707674741744995},{"id":"https://openalex.org/keywords/pigeonhole-principle","display_name":"Pigeonhole principle","score":0.4125162959098816},{"id":"https://openalex.org/keywords/fundamental-theorem","display_name":"Fundamental theorem","score":0.4079664647579193},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.39501839876174927},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3263976573944092},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.31928902864456177},{"id":"https://openalex.org/keywords/compactness-theorem","display_name":"Compactness theorem","score":0.2796538472175598},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.21707013249397278},{"id":"https://openalex.org/keywords/fixed-point-theorem","display_name":"Fixed-point theorem","score":0.1353231966495514},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.12378081679344177},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.0778900682926178}],"concepts":[{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.8374267816543579},{"id":"https://openalex.org/C68260962","wikidata":"https://www.wikidata.org/wiki/Q7200967","display_name":"Planarity testing","level":2,"score":0.8277957439422607},{"id":"https://openalex.org/C203265346","wikidata":"https://www.wikidata.org/wiki/Q11387554","display_name":"Proof assistant","level":3,"score":0.7531634569168091},{"id":"https://openalex.org/C206880738","wikidata":"https://www.wikidata.org/wiki/Q431667","display_name":"Automated theorem proving","level":2,"score":0.7203530669212341},{"id":"https://openalex.org/C173613240","wikidata":"https://www.wikidata.org/wiki/Q1150675","display_name":"Computer-assisted proof","level":3,"score":0.705534815788269},{"id":"https://openalex.org/C195653647","wikidata":"https://www.wikidata.org/wiki/Q7625047","display_name":"Structural proof theory","level":4,"score":0.6202526092529297},{"id":"https://openalex.org/C105605280","wikidata":"https://www.wikidata.org/wiki/Q7249999","display_name":"Proof complexity","level":3,"score":0.6177709698677063},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6097211837768555},{"id":"https://openalex.org/C135754263","wikidata":"https://www.wikidata.org/wiki/Q4751136","display_name":"Analytic proof","level":3,"score":0.5885533690452576},{"id":"https://openalex.org/C2318724","wikidata":"https://www.wikidata.org/wiki/Q852732","display_name":"Proof theory","level":3,"score":0.5320084691047668},{"id":"https://openalex.org/C2777026412","wikidata":"https://www.wikidata.org/wiki/Q2684591","display_name":"Statement (logic)","level":2,"score":0.5320034623146057},{"id":"https://openalex.org/C189950617","wikidata":"https://www.wikidata.org/wiki/Q937228","display_name":"Property (philosophy)","level":2,"score":0.48945558071136475},{"id":"https://openalex.org/C17566778","wikidata":"https://www.wikidata.org/wiki/Q467602","display_name":"Proofs of Fermat's little theorem","level":5,"score":0.4652017056941986},{"id":"https://openalex.org/C94461902","wikidata":"https://www.wikidata.org/wiki/Q2762418","display_name":"Formal proof","level":3,"score":0.45540720224380493},{"id":"https://openalex.org/C62073222","wikidata":"https://www.wikidata.org/wiki/Q1572108","display_name":"Natural deduction","level":2,"score":0.44283366203308105},{"id":"https://openalex.org/C2777686260","wikidata":"https://www.wikidata.org/wiki/Q144037","display_name":"Calculus (dental)","level":2,"score":0.43707674741744995},{"id":"https://openalex.org/C171988527","wikidata":"https://www.wikidata.org/wiki/Q188276","display_name":"Pigeonhole principle","level":2,"score":0.4125162959098816},{"id":"https://openalex.org/C194886279","wikidata":"https://www.wikidata.org/wiki/Q430271","display_name":"Fundamental theorem","level":3,"score":0.4079664647579193},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.39501839876174927},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3263976573944092},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.31928902864456177},{"id":"https://openalex.org/C171636804","wikidata":"https://www.wikidata.org/wiki/Q1149458","display_name":"Compactness theorem","level":4,"score":0.2796538472175598},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.21707013249397278},{"id":"https://openalex.org/C45962547","wikidata":"https://www.wikidata.org/wiki/Q1422068","display_name":"Fixed-point theorem","level":2,"score":0.1353231966495514},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.12378081679344177},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0778900682926178},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0},{"id":"https://openalex.org/C199343813","wikidata":"https://www.wikidata.org/wiki/Q12128","display_name":"Dentistry","level":1,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0},{"id":"https://openalex.org/C71924100","wikidata":"https://www.wikidata.org/wiki/Q11190","display_name":"Medicine","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-540-87827-8_28","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-87827-8_28","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W1601404805","https://openalex.org/W4315498604","https://openalex.org/W2786226606","https://openalex.org/W4381847735","https://openalex.org/W2011284628","https://openalex.org/W4233118026","https://openalex.org/W2042641733","https://openalex.org/W1527335482","https://openalex.org/W1496026483","https://openalex.org/W1503170941"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":8},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":7},{"year":2019,"cited_by_count":8},{"year":2018,"cited_by_count":13},{"year":2017,"cited_by_count":5},{"year":2016,"cited_by_count":8},{"year":2015,"cited_by_count":10},{"year":2014,"cited_by_count":8},{"year":2013,"cited_by_count":11},{"year":2012,"cited_by_count":5}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}