Abstract
We describe the results of an experiment in which the Nuprl proof development system was used in conjunction with a collection of simple proof-assisting programs to constructively prove a substantial theorem of number theory. We believe that these results indicate the promise of an approach to reasoning about computationally meaningful mathematics by which both proof construction and the results of formal reasoning are mathematically comprehensible.
Cite
CITATION STYLE
Howe, D. J. (1986). Implementing number theory: An experiment with Nuprl. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 230 LNCS, pp. 404–415). Springer Verlag. https://doi.org/10.1007/3-540-16780-3_108
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
