By non-universality of truth you mean that there is no function from the set of propositions formulated in a natural language to {0,1} which fulfills the expectation we have from truth? That’s true (ehm...) , but the reason is rather trivial: words of natural languages don’t specify the meaning uniquely and some amount of interpretation is always needed to figure out the meaning of a proposition. Given that propositions can probably be formulated with arbitrary precision if needed (even if not infinitely so), the disputes about meaning can be always resolved.
...words of natural languages don’t specify the meaning uniquely and some amount of interpretation is always needed to figure out the meaning of a proposition.
The need for interpretation is not limited to natural languages; it is required for any language. A context of assessment will derive meaning from a proposition based on its prior assumptions. For example a raw bit string may be interpreted to different meanings when read by different programs.
Given that propositions can probably be formulated with arbitrary precision if needed (even if not infinitely so), the disputes about meaning can be always resolved.
To resolve such disputes there must be a computable path to the resolution, and there won’t always be such a path. At a fundamental level not all problems are decidable. In more practical terms, the contexts involved in the dispute must implement some system that allows for convergence for all possible inputs; this condition will not always be satisfied.
By non-universality of truth you mean that there is no function from the set of propositions formulated in a natural language to {0,1} which fulfills the expectation we have from truth? That’s true (ehm...) , but the reason is rather trivial: words of natural languages don’t specify the meaning uniquely and some amount of interpretation is always needed to figure out the meaning of a proposition. Given that propositions can probably be formulated with arbitrary precision if needed (even if not infinitely so), the disputes about meaning can be always resolved.
The need for interpretation is not limited to natural languages; it is required for any language. A context of assessment will derive meaning from a proposition based on its prior assumptions. For example a raw bit string may be interpreted to different meanings when read by different programs.
To resolve such disputes there must be a computable path to the resolution, and there won’t always be such a path. At a fundamental level not all problems are decidable. In more practical terms, the contexts involved in the dispute must implement some system that allows for convergence for all possible inputs; this condition will not always be satisfied.