Classical interpretations of Gödel’s formal reasoning, and of his conclusions, implicitly imply that mathematical languages are essentially incomplete, in the sense that the truth of some arithmetical propositions of any formal mathematical language, under any interpretation, is, both, non-algorithmic, and essentially unverifiable. However, a language of general, scientific, discourse, which intends to mathematically express, and unambiguously communicate, intuitive concepts that correspond to scientific investigations, cannot allow its mathematical propositions to be interpreted ambiguously. Such a language must, therefore, define mathematical truth verifiably. We consider a constructive interpretation of classical, Tarskian, truth, and of Gödel’s reasoning, under which any formal system of Peano Arithmetic - classically accepted as the foundation of all our mathematical languages - is verifiably complete in the above sense. We show how some paradoxical concepts of Quantum mechanics can, then, be expressed, and interpreted, naturally under a constructive definition of mathematical truth.

Algorithm, arithmetic, Cantor, Cauchy, Church, classical, complete, computable, consistent, constructive, Dedekind, diagonal method, effective method, expressible, formal language, Gödel, halting, individually true, interpretation, intuitive, looping, mapping, mathematical object, model, natural number, number-theoretic, non-algorithmic, non-constructive, omega-consistent, Peano, predicate, primitive recursive, proposition, real number, recursive, recursively enumerable, representable, satisfiable, self-terminating, sentence, set theory, sound, standard model,Tarski, total function, truth,Turing, undecidable, uniformly true, ZFC.