Negation and linear completion *
Serenella Cerritot · 1992
Abstract The reasons motivating our choice of linear logic over classical or intuitionistic logic to study the problem of the semantics of logic programs may be explained as follows. Classical logic is not always useful to describe the declarative content of a program because there are situations where we need a commutation of the connectives with provability which classical logic does not provide: typically, the classical provability of A V B does not imply that either A is provable or Bis provable. Below, we illustrate this by means of an example (Example 1).