completeness of entailment

[pfps]

We don't have a completeness proof for the RDFS entailment rules (yet). Perhaps more important, it is unclear to me whether we even have a completeness argument for simple semantics.

This is not a fatal problem, but we should make sure that the document doesn't claim completeness if we don't have a proof.

[pfps]

It appears that there is no proof of the interpolation lemma. This should be done, but depends on the semantics staying the same. So the WG should make a decision that the current semantics is the desired one so that someone can find it worthwhile to try to prove the interpolation lemma.

[pfps]

Do we have a proof of the interpolation lemma?

[pfps]

Closed because there is a new issue for the interpolation lemma.