<--- Back to Details
First PageDocument Content
Proof assistants / Automated theorem proving / Logic in computer science / Type theory / Automath / Logic for Computable Functions / Nqthm / Proof theory / ACL2 / Mathematical proof / Andrzej Trybulec / Isabelle
Date: 2011-11-17 12:13:56
Proof assistants
Automated theorem proving
Logic in computer science
Type theory
Automath
Logic for Computable Functions
Nqthm
Proof theory
ACL2
Mathematical proof
Andrzej Trybulec
Isabelle

Can the computer really help us to prove theorems?

Add to Reading List

Source URL: www.cs.ru.nl

Download Document from Source Website

File Size: 301,30 KB

Share Document on Facebook

Similar Documents

A new implementation of Automath Freek Wiedijk () ∗  Department of Computer Science, University of Nijmegen, the Netherlands

A new implementation of Automath Freek Wiedijk () ∗ Department of Computer Science, University of Nijmegen, the Netherlands

DocID: 1mw23 - View Document

De Bruijn’s ideas on the Formalization of Mathematics Herman Geuvers Radboud Universiteit Nijmegen & Technische Universiteit Eindhoven Foundation of Mathematics for Computer-Aided Formalization Padova, 9-11 January 201

De Bruijn’s ideas on the Formalization of Mathematics Herman Geuvers Radboud Universiteit Nijmegen & Technische Universiteit Eindhoven Foundation of Mathematics for Computer-Aided Formalization Padova, 9-11 January 201

DocID: 1lUAk - View Document

Can the computer really help us to prove theorems?

Can the computer really help us to prove theorems?

DocID: 1lK2e - View Document

Automath in historisch perspectief Herman Geuvers Radboud Universiteit Nijmegen & Technische Universiteit Eindhoven Symposium ter ere van de 90ste verjaardag van N.G. de Bruijn Technische Universiteit Eindhoven 5 septemb

Automath in historisch perspectief Herman Geuvers Radboud Universiteit Nijmegen & Technische Universiteit Eindhoven Symposium ter ere van de 90ste verjaardag van N.G. de Bruijn Technische Universiteit Eindhoven 5 septemb

DocID: 1lFMz - View Document

Is ZF a hack? Comparing the complexity of some (formalist interpretations of )

Is ZF a hack? Comparing the complexity of some (formalist interpretations of )

DocID: 1FRs - View Document