Cited By
View all- Pope W(1984)A proposed graduate course in automatic software generationACM SIGCSE Bulletin10.1145/989341.98934916:2(29-33)Online publication date: 1-Jun-1984
Logic versus mathematics in computer science education
Authors: 
K. Culik, M. M. RizkiAuthors Info & Claims
K. Culik, M. M. RizkiAuthors Info & ClaimsPages 14 - 20
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.
References
[1]
R.B. Anderson, Proving Program Correctness, Wiley & Sons, 1979.
[2]
R.H. Austing, et al: Curriculum 78. CACM 22, March 1979, 147-166.
[3]
J.W. de Bakker: Mathematical Theory of Program Correctness, Prentice-Hall, 1980.
[4]
K. Culik, On Formal and Informal Proofs for Program Correctness, Tech. Report CSC82013, W.S.U., Detroit, MI, July 1982.
[5]
K. Culik, Computer Programming as Constructive Mathematical Proving, Tech. Report CSC82015, W.S.U., Detroit, MI, 1982.
[6]
E.W. Dijkstra, A discipline of programming, Prentice-Hall, 1976.
[7]
R.W. Floyd, Assigning Meanings to Programs, Proceedings of a Symposium in Applied Mathematics, 19-32, 1967.
[8]
D. Gries, Educating the programmer: Notations, Proofs, and the Development of Programs, Proceedings IFIP, 1980, North-Holland, 1980.
[9]
D. Gries, The Science of Programming, Springer, 1981.
[10]
S.L. Hantler, J.C. King, An Introduction to Proving the Correctness of Programs, Comp. Surveys 8, Sept. 1976, 331-353.
[11]
C.A.R. Hoare, An Axiomatic Basis of Computer Programming, Comm. of ACM, 1969.
[12]
S. Katz and Z. Manna, Logical Analysis of Programs, CACM, 188-206, April 1976.
[13]
S.C. Kleene, Introduction to Metamathematics, North-Holland, 1952.
[14]
D.E. Knuth, The Art of Computer Programming, Vol. 1, Fund. Algor., 2nd ed., 1973.
[15]
Z. Manna, Mathematical Theory of Computation, McGraw-Hill, 1974
[16]
R.A. deMillo, R.J. Lipton, A.J. Perlis, Social processes and proofs of theorems and programs, CACM 22, May 1979, 271-280
[17]
A. Mostowski, Mathematical Logic(Polish), University Press, Warsaw, 1948.
[18]
A. Ralston, Computer Science, Mathematics, and the Undergraduate Curricula in both, The American Math. Monthly 88, Aug-Sept. 1981, 472-485.
Index Terms
- Logic versus mathematics in computer science education
Recommendations
Logic versus mathematics in computer science education
SIGCSE '83: Proceedings of the fourteenth SIGCSE technical symposium on Computer science educationInformal 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 ...
On temporal logic versus datalog
Logic and complexity in computer scienceWe provide a direct and modular translation from the temporal logics CTL, ETL, FCTL (CTL extended with the ability to express fairness) and the Modal µ-calculus to Monadic inf-Datalog with built-in predicates. We call it inf-Datalog because the ...
Comments
Information & Contributors
Information
Published In
February 1983307 pages
Copyright © 1983 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 01 February 1983
Published in SIGCSE Volume 15, Issue 1
Check for updates
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 483Total Downloads
- Downloads (Last 12 months)107
- Downloads (Last 6 weeks)17
Reflects downloads up to 05 Feb 2025
Other Metrics
Citations
Cited By
View all- Pope W(1984)A proposed graduate course in automatic software generationACM SIGCSE Bulletin10.1145/989341.98934916:2(29-33)Online publication date: 1-Jun-1984
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in