Tarski undefinability totally refuted by junior high school logic

[PeteOlcott]

Sound deductive inference necessitates true conclusions
therefore sound deductive inference applied to formal
proofs of mathematical logic necessitates true consequences.

The above sentence is 100% of totally all that is needed to
define the True(x) the Tarski "proved" to be impossible to define.

[Eodnhoj7]

Sound deductive inference necessitates true conclusions
therefore sound deductive inference applied to formal
proofs of mathematical logic necessitates true consequences.

The above sentence is 100% of totally all that is needed to
define the True(x) the Tarski "proved" to be impossible to define.

False, soundness is a qualitative definition of a quantitatitative phenomenon (ie math). What is sound is grounded in an interpretation of phenomenon and this interpretation as to what constitutes soundness progressively variates with time.

What is sound today, given certain axioms in mathematics, may not be sound tomorrow given that the axioms that compose mathematics must be viewed as progressive quantities (if one is to quantify axiom growth in the history of mathematics).