Talk:Logical quantifiers

Almost-universal quantifier

The almost-universal quantifier, i.e. for all but one, might be denoted (by analogy with $\scriptstyle \exists !$) with $\scriptstyle \forall !\,$.

Example:

$\forall !\,p\in \mathbb {N} :p{\text{ prime and }}p{\text{ odd}}.$

I just made this up, I've never seen such usage though! — Daniel Forgues 04:54, 22 April 2013 (UTC)