|Abstract:||A formal proof system for unprovability in the predicate calculi is developed. This system is shown to be complete with respect to the logic of finite structures. Its applications may be extending the "negation by failure" of Prolog, preventing infinite loops in a deductive data base or Prolog. or proving formulas in a nonmonotonic (default) logic.|
|Copyright||The above paper is copyright by the Technion, Author(s), or others. Please contact the author(s) for more information|
Remark: Any link to this technical report should be to this page (http://www.cs.technion.ac.il/users/wwwb/cgi-bin/tr-info.cgi/1987/CS/CS0478), rather than to the URL of the PDF or PS files directly. The latter URLs may change without notice.
To the list of the CS technical reports of 1987
To the main CS technical reports page
Computer science department, Technion