Mathematical Logic in Computer Science
Author:
- Assaf KfouryAKAssaf Kfoury
Preprint
Abstract
The article retraces major events and milestones in the mutual influences between mathematical logic and computer science since the 1950s.Keywords
All Related Versions
This publication has 26 references indexed in Scilit:
- Macsyma: A personal historyJournal of Symbolic Computation, 2012
- The correctness of Newman’s typability algorithm and some of its extensionsTheoretical Computer Science, 2011
- Automated theorem provers: a practical tool for the working mathematician?Annals of Mathematics and Artificial Intelligence, 2011
- Modal characterisation theorems over special classes of framesAnnals of Pure and Applied Logic, 2009
- Robbins Algebras Are Boolean: A Revision of McCune's Computer-Generated Solution of Robbins ProblemJournal of Algebra, 1998
- The system F of variable types, fifteen years laterTheoretical Computer Science, 1986
- Necessary and sufficient conditions for the universality of programming formalismsActa Informatica, 1985
- Definability by programs in first-order structuresTheoretical Computer Science, 1983
- Program schemes, recursion schemes, and formal languagesJournal of Computer and System Sciences, 1973
- The unreasonable effectiveness of mathematics in the natural sciences. Richard courant lecture in mathematical sciences delivered at New York University, May 11, 1959Communications on Pure and Applied Mathematics, 1960