Meaning, that most illusive of philosophical concepts, is without doubt a ternary relation M(A,B,C): A means B relative to/in/according to C. To us "meaning" is simply a finitary algorithmic transformation that takes finite structured data of sort 1 into finite structured data of sort 2 (which can be the same sort 1, for instance in normalization of types). The canonical example is a compiler. The Tarskian "meaning" used in model theory is, as usually conceived, misleading. In reality it is nothing more than a finitary recursive transformation of the expressions of a formal system into expressions in some version of formal set theory. This transformation is interpretation. And interpretations can themselves be interpreted or transformed just as compilers are themselves programs which must be compiled.
Our natural term logic NTL gives three examples of meaning, of finitary recursive transformation or interpretations. The normalization of NTL terms to reveal the canonical term which conveys core logical "meaning", the tranformation of NTL terms into terms in the more coarse-grained Bealer Logic and the transformation of Bealer Logic terms into normal NTL terms.
Another interpretation is the one that follows from a priori meta-theoretic postulates whereby deductive data in one system is taken as sufficient grounds for meta-theorems about another systems (meta-theoretic mirroring).
Feedback for queries of data bases, for questions or commands, are also interpretations.
Theories of "meaning-as-use" are false and circular and do not explain "meaning" and cannot count as a theory of meaning (this is explored elsewhere).
We can think of interpretations as functors. Natural transformations are themselves particular cases of functors.
The human mind is equipped with a finite series of interpretations which are successively or concurrently applied to symbolic data. But this process has to stop, it has to have a fixed point. Thus there are finite, bounded, combinatoric, recursive-algorithmic, rule-constituting, self-reflecting "semantic primes" or "intuitive primes" which have no interpretation beyond themselves (up to isomorphism?). The task of semantics and the philosophy of language is to find these generators and in particular universal components which must be assumed for any adequate possible logic or programing language. It may be the ultrafinitism may shed light on these problems.
This parallels the synthetic a priori principles of the human understanding where the finite combinatorics of one system has to be assumed to be sufficient epistemic grounds (security, certification, checking) relating to the combinatorics of another system (this is achieved through mirroring and meta-interpretation). Thus we can deduce a priori (using a certain formal system) the number of steps for a given algorithm on a certain system to terminate in function of the input length and then we can verify this empirically on the system. Proof mining does this but still in an ideal non-finitary framework. Note a certain Pythagoreanism in category theory. The dyad can be embodies as the category with two objects and no non-identity arrows, as a category with two objects and one non-identity arrow or a category with two objects and two non-identity arrows. These diagrams suffice to calculate all limits and to define natural transformations as functors!
This suggests that reality corresponds to a hierarchy of different levels of being and on each level finite structures mirror each other in a finite multiplicity of ways, mirror those beneath and mirror those above them in determinate ways. They are woven together like beads on a string. All these correspondences must be accepted as a priori conditions for the possibility of intelligibility and cognizability and meaning. Thus also our semantic primitives or categories themselves must be considered according to the level they are implemented/manifest on (or participated by).
Study finite embodiments of the absolute Galois group, the algebraic closure of $\mathbb{Q}$ and of countable models of set theory. Study approximate categories with only finitely many objects and morphisms. Study finite versions of quantum field theory. Study finite versions of the calculus based on the approximate implementation of real numbers in standard hardware. Study logical systems with constraints on expressions and rule applications (finite versions of exponentials, etc.). How much ultrafinitist mathematics, logic, algorithmic theory and philosophy is not hidden deep inside the Pari and Singular algebra software?
It is quantum field theory, not quantum mechanics that is fundamental. Quantum mechanics is at most an incoherent abstraction of quantum field theory (it is chosen as an introduction due to an alleged similarity to classical physics, but such a similarity is based on ad hoc magical postulates about "promoting" physical quantities to operators). Indeed the quantum mechanical position and momentum operators are imbued with particle ontology and do not make sense at all from the point of view of quantum field theory (what is the momentum operator measuring the momentum of?). And neither does the uncertainty principle. Perhaps the fact that the quantum harmonic oscillator has discrete enemy levels is a consequence of the fundamental finiteness of the universe. The uncertainty principle may be tied to the properties of physics assuming the fundamental discreteness of space and time and energy. Maybe there is a link to Minkowski's theorem. And quantum field theory be elucidated by the classical finite approximation (vibrating lattice phonons).


