MetiTarski: An Automatic Prover for the Elementary Functions
Proceedings of the 9th AISC international conference, the 15th Calculemas symposium, and the 7th international MKM conference on Intelligent Computer Mathematics
Trust and Automation in Verification Tools
ATVA '08 Proceedings of the 6th International Symposium on Automated Technology for Verification and Analysis
Automating proofs in category theory
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
Formal probabilistic analysis of cyber-physical transportation systems
ICCSA'12 Proceedings of the 12th international conference on Computational Science and Its Applications - Volume Part III
Formal verification of cyber-physical systems: coping with continuous elements
ICCSA'13 Proceedings of the 13th international conference on Computational Science and Its Applications - Volume 1
| Hi-index | 0.00 |
It is generally accepted that in principle it''s possible to formalize completely almost all of present-day mathematics. The practicability of actually doing so is widely doubted, as is the value of the result. But in the computer age we believe that such formalization is possible and desirable. In contrast to the QED Manifesto however, we do not offer polemics in support of such a project. We merely try to place the formalization of mathematics in its historical perspective, as well as looking at existing praxis and identifying what we regard as the most interesting issues, theoretical and practical.