Logic Algorithm and Specification

Definition 7-7 LA t ) is partially correct wrt E r) iff the next condition holds  

For ease of notation, the set E (r) of positive examples is here also considered to denote the corresponding set of tuples. Similarly for the set E (r) of negative examples. 

Any of these criteria holds between a logic algorithm LA(f) and a specification EP r) iff it holds between LA r) and both the example set and the property set of EP r), 

Total correctness thus means that what is computed (positively or negatively) by the logic algorithm must be consistent with its (part of the) specification. For a tuple t where the considered (part of the) specification is undecidable (that is, where t EP (r) and t EP r)), r(t) can be either true or false in the logic algorithm. 

---