Boolean languages

Boolean languages correspond to:

• Boolean grammars ↗

Limited Boolean

If we limit Boolean grammar to allow to use negation only under intersection maybe it would be possible to prove that system is Scott-continuous e.g. can be solved under minimal fixed point. Obvious counter example: $\Sigma^* \cap A'$