 The expressions obtained via the transformations outlined above quickly become lengthy—as trying to rewrite a simple FOL sentence such as \(\exists x(Px\land Qx)\) can show.[6]  However, this does not diminish the importance of Schönfinkel’s theoretical results. A slight increase (if any) in the length of the expressions is not even an inconvenience, let alone an impediment in the era of computers with petabytes (or even exa- and zettabytes) of memory.