Compartir
thirty five years of automating mathematics (en Inglés)
$ 422.682
$ 845.364
Ahorras: $ 422.682
Elige la lista en la que quieres agregar tu producto o crea una nueva lista
✓ Producto agregado correctamente a la lista de deseos.
Ir a Mis Listas
Origen: Estados Unidos
(Costos de importación incluídos en el precio)
Se enviará desde nuestra bodega entre el
Martes 21 de Mayo y el
Martes 04 de Junio.
Lo recibirás en cualquier lugar de Colombia entre 1 y 5 días hábiles luego del envío.
Reseña del libro "thirty five years of automating mathematics (en Inglés)"
n.g. de bruijn was a well established mathematician before deciding in 1967 at the age of 49 to work on a new direction related to automating mathematics. in the 1960s he became fascinated by the new computer technology and decided to start the automath project where he could check, with the help of the computer, the correctness of books on mathematics. through his work on automath de bruijn started a revolution in using the computer for verification, and since, we have seen more and more proof-checking and theorem-proving systems. automath was written in algol 60 and implemented on the primitive computers of the sixties. thirty years on, both technology and theory have evolved a lot leading to impressive new directions in using the computer for manipulating and checking mathematics. this volume is a collection of papers with a personal flavour. it consists of 11 articles which propose interesting variations to or examples of mechanising mathematics and illustrate differ developments in symbolic computation in the past 35 years. the first paper is by de bruijn himself where he uses his experience of automating mathematics to reason about the human mind. after that a number of intriguing articles have been contributed by amongst others henk barendregt, who proposes a mathematical proof language between informal and formalised mathematics which helps make proof assistants more user friendly, and robert constable, explaining how automaths telescopes, books and definitions compare to recent developments in computational type theory made by his nuprl group. the volume further includes a strong argumentation by arnon avron that for automated reasoning, there is an interesting logic, somewhere strictly between first and second order logic, determined essentially by an analysis of transitive closure, yielding induction; and murdoch gabbay presenting an interesting generalisation of fraenkel-mostowski (fm) set theory within higher-order logic, and applying it to model milners p-calculus.
- 0% (0)
- 0% (0)
- 0% (0)
- 0% (0)
- 0% (0)
Todos los libros de nuestro catálogo son Originales.
El libro está escrito en Inglés.
✓ Producto agregado correctamente al carro, Ir a Pagar.
