|
Modify search criterions 2 matches
| Title |
Type theory and proof processing system |
| Author |
DOWEK Gilles |
| Keywords |
Computation, Deduction, Function, Mathematical language, Proof, Proof processing systems, Set theory, Type theory |
| Topics |
Computer Sciences, Computing, Logic, Sets, Software |
| Abstract |
Since the end of the sixties, several computer programs allowing to process mathematical knowledge, and in particular mathematical proofs, have been designed. Building such programs raises new questions, in particular that of the conception of logical frameworks where mathematics can be formalized in practice. This is a new direction for fundational studies, more interested, so far, in formalization of mathematics in principle, than in practice. Several reasons explain that the designers of such programs often chose type theory rather than set theory to formalize mathematics. |
| Number |
165, Spring 2004, special issue: Constructive type theory |
| Language |
French | Read the article
Users rights :

The entire journal is licensed under a Creative Commons license
|