Call a set of assertions sd complete (with respect to a class of programs .9') if for any p, a e sof and S e ,g', whenever 1/21.5{q} holds, then all intermediate assertions can be chosen from st This paper is devoted to the study of the problem which sets of assertions are complete in the above sense. We prove that any set of recursive assertions containing true and false is not complete. We pr...
