Pular para o conteúdo
Ciências Exatas

Thirty Five Years Of Automating Mathematics

1ª Edição - 2003328 páginasSpringer Verlag *pt
Seja o primeiro a avaliar
Sua leitura no Lireo

Guarde este livro na sua estante

Crie uma conta gratuita e continue exatamente desta página.

Registre seu progresso de leitura
Descubra outros leitores do mesmo livro
Participe de clubes de leitura
Organize toda sua biblioteca

Sinopse

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 Automath's 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 Milne

Detalhes do livro

Título
Thirty Five Years Of Automating Mathematics
Autor
F.D. Kamareddine
Editora
Springer Verlag *
Ano
2026
Páginas
328 páginas
Idioma
PT
ISBN-13
9781402016561
Edição
1ª Edição - 2003
Formato
Hardcover

Mais de F.D.

Outros livros de F.D. Kamareddine

Ciências Exatas

Livros na mesma categoria

Blog Lireo

Dicas e recomendações para leitores

Soluções institucionais

Para escolas, universidades, autores e editoras