Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2022
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2210.08405 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866916507757314048 |
|---|---|
| author | Naderian, Farhad |
| author_facet | Naderian, Farhad |
| contents | 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ödel`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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2210_08405 |
| institution | arXiv |
| publishDate | 2022 |
| record_format | arxiv |
| spellingShingle | Non-Transferability in Communication Channels and Tarski`s Truth Theorem Naderian, Farhad Logic in Computer Science Information Theory 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ödel`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. |
| title | Non-Transferability in Communication Channels and Tarski`s Truth Theorem |
| topic | Logic in Computer Science Information Theory |
| url | https://arxiv.org/abs/2210.08405 |