Artículo
Verifying the bridge between simplicial topology and algebra: the Eilenberg–Zilber algorithm
Autor/es | Lambán Pardo, Laureano
Rubio, Julio Martín Mateos, Francisco Jesús Ruiz Reina, José Luis |
Departamento | Universidad de Sevilla. Departamento de Ciencias de la Computación e Inteligencia Artificial |
Fecha de publicación | 2013 |
Fecha de depósito | 2019-05-20 |
Publicado en |
|
Resumen | The Eilenberg–Zilber algorithm is one of the central components of the computer algebra system called Kenzo, devoted to
computing in Algebraic Topology. In this article we report on a complete formal proof of the underlying ... The Eilenberg–Zilber algorithm is one of the central components of the computer algebra system called Kenzo, devoted to computing in Algebraic Topology. In this article we report on a complete formal proof of the underlying Eilenberg–Zilber theorem, using the ACL2 theorem prover. As our formalization is executable, we are able to compare the results of the certified programme with those of Kenzo on some universal examples. Since the results coincide, the reliability of Kenzo is reinforced. This is a new step in our long-term project towards certified programming for Algebraic Topology. |
Identificador del proyecto | MTM2009-13842
243847 (ForMath) |
Cita | Lambán Pardo, L., Rubio, J., Martín Mateos, F.J. y Ruiz Reina, J.L. (2013). Verifying the bridge between simplicial topology and algebra: the Eilenberg–Zilber algorithm. Logic Journal of the IGPL, 22 (1), 39-65. |
Ficheros | Tamaño | Formato | Ver | Descripción |
---|---|---|---|---|
Verifying the bridge between ... | 460.8Kb | [PDF] | Ver/ | |