This site is supported by donations to The OEIS Foundation.

# Talk:Logical quantifiers

The almost-universal quantifier, i.e. for all but one, might be denoted (by analogy with ${\displaystyle \scriptstyle \exists !}$) with ${\displaystyle \scriptstyle \forall !\,}$.
${\displaystyle \forall !\,p\in \mathbb {N} :p{\text{ prime and }}p{\text{ odd}}.}$