| http://www.w3.org/ns/prov#value | - More precisely, we show that the class of context-free languages coincides with the class of those sets of strings which can be defined by sentences of the form 9 b', where ' is first order, b is a binary predicate symbol, and the range of the second order quantifier is restricted to the class of matchings.
|
