Enter a brief description of your changes
(Required)
Minor changes are by default collapsed in the page history.
No changes
The page does not exist yet.
Failed to load changes
Version by on
Leave Collaboration
Are you sure you want to leave the realtime collaboration and continue editing alone? The changes you save while editing alone will lead to merge conflicts with the changes auto-saved by the realtime editing session.
Predicate Logic as Programming Language
Robert A. Kowalski
Information Processing 74 – Proceedings of the 1974 IFIP Congress, pages 569–574
North-Holland Publishing Company, Amsterdam, The Netherlands
1974
The interpretation of predicate logic as a programming language is based upon the interpretation of implications B if A1 and ... and An as procedure declarations, where B is the procedure name and A1, \ldots, An is the set of procedure calls Ai constituting the procedure body. An axiomatisation of a problem domain is a program for solving problems in that domain. Individual problems are posed as theorems to be proved. Proofs are computations generated by the theorem-prover which executes the program incorporated in the axioms. Our thesis is that predicate logic is a useful and practical, high-level, non-deterministic programming language with sound theoretical foundations.
