| http://www.w3.org/ns/prov#value | - Formulas The set of well-formed formulas (usually called wffs or just formulas) is recursively defined by the following rules: Simple and complex predicates If P is a relation of valence n and a1, ..., an are terms then P(a1,...,an) is a well-formed formula.
|
