I now offer up my own generalizations of Doron's MAF. Since they each contain MAF as a proper subset, I claim they are each more powerful than MAF.
Formulation #1:
Let f be an arbitrary function.
Let x, y, z, ... be arbitrary elements.
An example of an EMAF (extended MAF) is
f(x,y,z).
More generally,
Let A be an n-tuple of arbitrary elements, where n is arbitrary.
All EMAF's are of the from
f(A)
Formulation #2:
Let
X be anything at all.
All EMAF's are of the form
X.
Discussion:
In formulation #1, it is clear that any doron underbar relation _ can be expressed as a function
f and any asterisk element * can be expressed as a lowercase letter. So, simple function notation contains all of doron's MAF as a proper subset. Moreover, since
A is not restricted to be a finite tuple, EMAF's clearly cover notions and concepts outside those available in MAF.
In formulation #2, well, since
X can be anything, all of doron's MAF is included as a proper subset, all of formulation #1 is included, and well, all of everything else is included, too.
Conclusion:
Although formulation #1, unlike doron's MAF, is consistent with standard mathematical notation formulation #2 has such expressive simplicity to be preferred for all applications.
See how easy it is to be deep?