 Classical first-order logic (FOL) can be interpreted in \(\textsf{DPL}\) as follows. We assume that the FOL language has the following connectives and quantifiers: \(\top , \bot , \wedge , \rightarrow , \exists x\). We translate as follows: