Orit Hazzan
Abstract
Based on the analogy between mathematical proofs and computer programs this paper illustrates how it is possible to apply methodologies from computer science, used in the development and presentation of computer programs, for the presentation of mathematical theorems and proofs. The following three methodologies are discussed: stepwise refinement, abstraction, and program verification.
- Abelson, H. and Sussman, G. J. (1986). Structure and Interpretation of Computer Programs, MIT Press and McGraw-Hill.]] Google Scholar
Digital Library
- Avital, S. M. (1973). The 'Let us define a function' syndrome. International Journal of Mathematics Education in Science and Technology4, pp. 143--147.]]Google Scholar
- De Millo, R. A., Lipton, R. J. and Perlis, A. J. (1979). Social processes and proofs of theorems and programs. Communications of the ACM22(5), pp. 271--280.]] Google ScholarDigital Library
- Dijkstra, E. W. (1972). Notes on structured programming. In Dahl, O. J., Hoare, C. A. R. and Dijkstra, E. W. (eds.). Structured Programming, Academic Press, New-York.]] Google ScholarDigital Library
- Dijkstra, E.W. (1986). On a cultural gap. The Mathematical Intelligencer8(1), pp. 48--52.]]Google Scholar
- Dijkstra, E.W. (1989). A somewhat open letter to Uri Leron -- EWD1049. Unpublished personal correspondence.]]Google Scholar
- Gray, R. (1991). Computer Programs and Mathematical Proofs. The Mathematical Intelligencer13(4), pp. 45--48.]]Google Scholar
- Gries, D. (1981). The Science of Programming, Springer-Verlag, New-York, Inc.]] Google ScholarDigital Library
- Halmos, P. R. (1973). How to write mathematics. In Steenrod, N. E., Halmos, P. R., Schiffer, M. M. and Dieudonne, J. A. How to Write Mathematics?, American Mathematical Society.]]Google Scholar
- Hoare, C. A. R. (1986). Mathematics of programming. Byte, August, pp. 115--124, 148--150.]]Google Scholar
- Honsberger, R. (1985). Mathematical Games III. The Mathematical Association of America.]]Google Scholar
- Knuth, D. E. (1974). Computer science and its relation to mathematics. The American Mathematical Monthly, 81 (April), pp. 323--343.]]Google ScholarCross Ref
- Lakatos, I. (1976). Proofs and Refutations. Cambridge: Cambridge University Press.]]Google Scholar
- Leron, U. (1983). Structuring mathematical proofs. American Mathematical Monthly, 90(3), pp. 174--185.]]Google ScholarCross Ref
- Leron, U. (1985). Heuristic presentations: The role of structuring. For the Learning of Mathematics5(3), pp. 7--13.]]Google Scholar
- Martin-Lof, P. (1985). Constructive mathematics and computer programming. In Hoare, C. A. R. and Shepherdson (eds.). Mathematical Logic and Programming Languages, Prentice-Hall International.]] Google ScholarDigital Library
- Mizler, D. (1968). Calculus, Ha'omanim Press, Jerusalem. (Hebrew).]]Google Scholar
- Steenrod, N. E. (1973). How to write mathematics. In Steenrod, N. E., Halmos, P. R., Schiffer, M. M. and Dieudonne, J. A. How to Write Mathematics?, American Mathematical Society.]]Google Scholar
- Wells, C. (1995). Communicating mathematics: Useful ideas from computer science. The American Mathematical Monthly102(5), pp. 397--408.]]Google Scholar
- Wirth, N. (1971). Program development by stepwise refinement. Communications of the ACM14(4), pp. 221--227.]] Google ScholarDigital Library
Index Terms
- Application of computer science ideas to the presentation of mathematical theorems and proofs
Recommendations
Computer understanding of mathematical proofs
IJCAI'77: Proceedings of the 5th international joint conference on Artificial intelligence - Volume 2Mathematical proofs constitute a mixture of formulas with a subset of natural language. They can be represented as a sequence of lines expressible in the symbolism of predicate calculus. The transition from step to step may depend on a series of logical ...
Combinatorial proofs and decomposition theorems for first-order logic
LICS '21: Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer ScienceWe uncover a close relationship between combinatorial and syntactic proofs for first-order logic (without equality). Whereas syntactic proofs are formalized in a deductive proof system based on inference rules, a combinatorial proof is a syntax-free ...
Comments