Proof Pearl: a Formal Proof of Higman’s Lemma in ACL2
Higman’s lemma is an important result in infinitary combinatorics, which has been formalized in several theorem provers. In this paper we present a formalization and proof of Higman’s Lemma in the ACL2 theorem prover. Our formalization is based on a proof by Murthy and Russell, where the key termina...
| Autores: | , , , |
|---|---|
| Tipo de recurso: | artículo |
| Estado: | Versión enviada para evaluación y publicación |
| Fecha de publicación: | 2011 |
| País: | España |
| Institución: | Universidad de Sevilla (US) |
| Repositorio: | idUS. Depósito de Investigación de la Universidad de Sevilla |
| OAI Identifier: | oai:idus.us.es:11441/86293 |
| Acceso en línea: | https://hdl.handle.net/11441/86293 https://doi.org/10.1007/s10817-010-9178-x |
| Access Level: | acceso abierto |
| Palabra clave: | Higman’s lemma Formal proofs ACL2 |
| id |
ES_ecb1efc65ed6159a5b33bebacd71a78e |
|---|---|
| oai_identifier_str |
oai:idus.us.es:11441/86293 |
| network_acronym_str |
ES |
| network_name_str |
España |
| repository_id_str |
|
| spelling |
Proof Pearl: a Formal Proof of Higman’s Lemma in ACL2Martín Mateos, Francisco JesúsRuiz Reina, José LuisAlonso Jiménez, José AntonioHidalgo Doblado, María JoséHigman’s lemmaFormal proofsACL2Higman’s lemma is an important result in infinitary combinatorics, which has been formalized in several theorem provers. In this paper we present a formalization and proof of Higman’s Lemma in the ACL2 theorem prover. Our formalization is based on a proof by Murthy and Russell, where the key termination argument is justified by the multiset relation induced by a well-founded relation. To our knowledge, this is the first mechanization of this proof.Ministerio de Ciencia e Innovación MTM2009-13842-C02-02SpringerCiencias de la Computación e Inteligencia ArtificialTIC137: Lógica, Computación e Ingeniería del Conocimiento2011info:eu-repo/semantics/articleinfo:eu-repo/semantics/submittedVersionapplication/pdfapplication/pdfhttps://hdl.handle.net/11441/86293https://doi.org/10.1007/s10817-010-9178-xreponame:idUS. Depósito de Investigación de la Universidad de Sevillainstname:Universidad de Sevilla (US)InglésJournal of Automated Reasoning, 47 (3), 229-250.MTM2009-13842-C02-02https://link.springer.com/article/10.1007/s10817-010-9178-xinfo:eu-repo/semantics/openAccessoai:idus.us.es:11441/862932026-06-17T12:51:07Z |
| dc.title.none.fl_str_mv |
Proof Pearl: a Formal Proof of Higman’s Lemma in ACL2 |
| title |
Proof Pearl: a Formal Proof of Higman’s Lemma in ACL2 |
| spellingShingle |
Proof Pearl: a Formal Proof of Higman’s Lemma in ACL2 Martín Mateos, Francisco Jesús Higman’s lemma Formal proofs ACL2 |
| title_short |
Proof Pearl: a Formal Proof of Higman’s Lemma in ACL2 |
| title_full |
Proof Pearl: a Formal Proof of Higman’s Lemma in ACL2 |
| title_fullStr |
Proof Pearl: a Formal Proof of Higman’s Lemma in ACL2 |
| title_full_unstemmed |
Proof Pearl: a Formal Proof of Higman’s Lemma in ACL2 |
| title_sort |
Proof Pearl: a Formal Proof of Higman’s Lemma in ACL2 |
| dc.creator.none.fl_str_mv |
Martín Mateos, Francisco Jesús Ruiz Reina, José Luis Alonso Jiménez, José Antonio Hidalgo Doblado, María José |
| author |
Martín Mateos, Francisco Jesús |
| author_facet |
Martín Mateos, Francisco Jesús Ruiz Reina, José Luis Alonso Jiménez, José Antonio Hidalgo Doblado, María José |
| author_role |
author |
| author2 |
Ruiz Reina, José Luis Alonso Jiménez, José Antonio Hidalgo Doblado, María José |
| author2_role |
author author author |
| dc.contributor.none.fl_str_mv |
Ciencias de la Computación e Inteligencia Artificial TIC137: Lógica, Computación e Ingeniería del Conocimiento |
| dc.subject.none.fl_str_mv |
Higman’s lemma Formal proofs ACL2 |
| topic |
Higman’s lemma Formal proofs ACL2 |
| description |
Higman’s lemma is an important result in infinitary combinatorics, which has been formalized in several theorem provers. In this paper we present a formalization and proof of Higman’s Lemma in the ACL2 theorem prover. Our formalization is based on a proof by Murthy and Russell, where the key termination argument is justified by the multiset relation induced by a well-founded relation. To our knowledge, this is the first mechanization of this proof. |
| publishDate |
2011 |
| dc.date.none.fl_str_mv |
2011 |
| dc.type.none.fl_str_mv |
info:eu-repo/semantics/article info:eu-repo/semantics/submittedVersion |
| format |
article |
| status_str |
submittedVersion |
| dc.identifier.none.fl_str_mv |
https://hdl.handle.net/11441/86293 https://doi.org/10.1007/s10817-010-9178-x |
| url |
https://hdl.handle.net/11441/86293 https://doi.org/10.1007/s10817-010-9178-x |
| dc.language.none.fl_str_mv |
Inglés |
| language_invalid_str_mv |
Inglés |
| dc.relation.none.fl_str_mv |
Journal of Automated Reasoning, 47 (3), 229-250. MTM2009-13842-C02-02 https://link.springer.com/article/10.1007/s10817-010-9178-x |
| dc.rights.none.fl_str_mv |
info:eu-repo/semantics/openAccess |
| eu_rights_str_mv |
openAccess |
| dc.format.none.fl_str_mv |
application/pdf application/pdf |
| dc.publisher.none.fl_str_mv |
Springer |
| publisher.none.fl_str_mv |
Springer |
| dc.source.none.fl_str_mv |
reponame:idUS. Depósito de Investigación de la Universidad de Sevilla instname:Universidad de Sevilla (US) |
| instname_str |
Universidad de Sevilla (US) |
| reponame_str |
idUS. Depósito de Investigación de la Universidad de Sevilla |
| collection |
idUS. Depósito de Investigación de la Universidad de Sevilla |
| repository.name.fl_str_mv |
|
| repository.mail.fl_str_mv |
|
| _version_ |
1869423361964113920 |
| score |
15,301603 |