A reunion of Gödel, Tarski, Carnap and Rosser.
Saved in:
| Title: | A reunion of Gödel, Tarski, Carnap and Rosser. |
|---|---|
| Authors: | Salehi, Saeed1 (AUTHOR) salehipour@tabrizu.ac.ir |
| Source: | Journal of Logic & Computation. Sep2024, Vol. 34 Issue 6, p1172-1178. 7p. |
| Subjects: | Incompleteness theorems, Reunions |
| Abstract: | We unify Gödel 's first incompleteness theorem (1931), Tarski 's undefinability theorem (1933), Gödel-Carnap 's diagonal lemma (1934) and Rosser 's (strengthening of Gödel 's first) incompleteness theorem (1936), whose proofs resemble much and use almost the same technique. [ABSTRACT FROM AUTHOR] |
| Copyright of Journal of Logic & Computation is the property of Oxford University Press / USA and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Engineering Source |
|
Full text is not displayed to guests.
Login for full access.
|
|
| Abstract: | We unify Gödel 's first incompleteness theorem (1931), Tarski 's undefinability theorem (1933), Gödel-Carnap 's diagonal lemma (1934) and Rosser 's (strengthening of Gödel 's first) incompleteness theorem (1936), whose proofs resemble much and use almost the same technique. [ABSTRACT FROM AUTHOR] |
|---|---|
| ISSN: | 0955792X |
| DOI: | 10.1093/logcom/exad001 |
