You can combine the results of two search paths with the set operators:
union
intersect
except
but the place for boolean expressions is in expansions of the * placeholder within a search path.
In the case you give, it would be possible to define two sets:
the whole descendant tree of FINANZEN
the set of notes
and to subtract one from the other with except, but this approach is slower (computationally more expensive) because it involves three processes in lieu of one:
Collecting the first set,
collecting the second set,
performing a set operation over the two sets to obtain a third set.
On the other hand, it’s possible that you may find it quicker or more intuitive to write a set expression over two searches than a boolean refinement of one search. So an additional route to what you describe might be: