Affiliation:
1. Department of Computer Science, Wayne State University, Detroit, MI
Abstract
Informal mathematical proofs admit and require interpretation while formal logic proofs suppress (abstract from) meanings. The former is closely related to problem solving and computer programming. The latter, which is commonly used for proving program correctness, complicates this procedure because it separates problem solving from programming. A constructive mathematical proof in finite discrete mathematics of an existential theorem is a computer program if the pertinent data structures and functions are expressed in a programming language. Several detailed examples of graph theoretical problems and theorems are presented along with their constructive proofs and corresponding programs.
Publisher
Association for Computing Machinery (ACM)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献