RE: XPath: all elements with only non-parent children

> DeMorgan's theorem can be proved by complete induction over all
> possible inputs.  I don't think it makes any requirements other than
> that the functions behave like the boolean opeators they're meant to
> emulate. 

I'm not sure that the requirements is for Boolean operators since I recall
that DeMorgan's applies to regular sets and unions and intersections?  But
then again, you may still have to have an algebra and that would perhaps
imply that some of the other things such as commutivity have to apply?


 XSL-List info and archive:  http://www.mulberrytech.com/xsl/xsl-list