  Often, two disjunction connectives are also used. These are defined in terms of \(\amp\) and \(\wedge\), respectively, via the usual de Morgan laws using \(\neg\). For the first-order Łukasiewicz systems one adds two quantifiers \(\forall\), \(\exists\) in such a way that the truth degree of \(\forall xH(x)\) is the infimum of all the relevant truth degrees of \(H(x)\), and that the truth degree of \(\exists xH(x)\) is the supremum of all the relevant truth degrees of \(H(x)\).