Verifying the bridge between simplicial topology and algebra: the Eilenberg-Zilber algorithm
Se ha publicado un artículo de razonamiento formalizado en ACL2 titulado Verifying the bridge between simplicial topology and algebra: the Eilenberg-Zilber algorithm.
Sus autores son
- Laureano Lambán (de la Universidad de la Rioja),
- Julio Rubio (de la Universidad de la Rioja),
- Francisco J. Martín Mateos (de la Universidad de Sevilla) y
- José L. Ruiz Reina (de la Universidad de Sevilla).
Su resumen es
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.
El artículo se ha publicado en Logic Journal of the IGPL.
Los códigos de las correspondientes teorías en ACL2 se encuentran aquí.