This article explores the concept of transferability within communication channels, with a particular focus on the inability to transmit certain situations through these channels. The Channel Non-Transferability Theorem establishes that no encoding-decoding mechanism can fully transmit all propositions, along with their truth values, from a transmitter to a receiver. The theorem underscores that when a communication channel attempts to transmit its own error state, it inevitably enters a non-transferable condition. I argue that Tarski`s Truth Undefinability Theorem parallels the concept of non-transferability in communication channels. As demonstrated in this article, the existence of non-transferable codes in communication theory is mathematically equivalent to the undefinability of truth as articulated in Tarski`s theorem. This equivalence is analogous to the relationship between the existence of non-computable functions in computer science and G\"odel`s First Incompleteness Theorem in mathematical logic. This new perspective sheds light on additional aspects of Tarski`s theorem, enabling a clearer expression and understanding of its implications. Keywords: Non-Transferability, Channel Theory, Tarski`s Truth Theorem, Semantic.

翻译：本文探讨了通信信道中的可传递性概念，特别关注某些情境无法通过这些信道进行传输的现象。信道不可传递定理确立了不存在任何编码-解码机制能够将全部命题及其真值从发送方完整传递至接收方。该定理强调，当通信信道试图传输其自身的错误状态时，必然进入不可传递状态。本文论证了塔斯基的真值不可定义定理与通信信道中的不可传递性概念具有平行对应关系。如文中所证，通信理论中不可传递码的存在性在数学上等价于塔斯基定理所阐述的真值不可定义性。这种等价关系类似于计算机科学中不可计算函数的存在性与数理逻辑中哥德尔第一不完备定理之间的对应关系。这一新视角揭示了塔斯基定理的更多维度，使其内涵得以更清晰地表述和理解。关键词：不可传递性，信道理论，塔斯基真值定理，语义学。