| http://www.w3.org/ns/prov#value | - We then prove a completeness theorem for proofs in this extended setting: for any behaviour (formula) A and any design (proof attempt) P, either P is a proof of A or there is a model M in the orthogonal of A which beats P. Compared with proofs of full completeness in game semantics, ours exhibits a striking similarity with proofs of Goedel???????????? completeness, in that it explicitly constructs
|
