{"title":"哥德尔、塔尔斯基、卡尔纳普和罗瑟的重逢","authors":"Saeed Salehi","doi":"10.1093/logcom/exad001","DOIUrl":null,"url":null,"abstract":"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.","PeriodicalId":50162,"journal":{"name":"Journal of Logic and Computation","volume":"36 1","pages":"0"},"PeriodicalIF":0.7000,"publicationDate":"2023-02-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A reunion of<scp>Gödel, Tarski, Carnap</scp>and<scp>Rosser</scp>\",\"authors\":\"Saeed Salehi\",\"doi\":\"10.1093/logcom/exad001\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"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.\",\"PeriodicalId\":50162,\"journal\":{\"name\":\"Journal of Logic and Computation\",\"volume\":\"36 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.7000,\"publicationDate\":\"2023-02-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Logic and Computation\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1093/logcom/exad001\",\"RegionNum\":4,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"COMPUTER SCIENCE, THEORY & METHODS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Logic and Computation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1093/logcom/exad001","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
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.
期刊介绍：
Logic has found application in virtually all aspects of Information Technology, from software engineering and hardware to programming and artificial intelligence. Indeed, logic, artificial intelligence and theoretical computing are influencing each other to the extent that a new interdisciplinary area of Logic and Computation is emerging.
The Journal of Logic and Computation aims to promote the growth of logic and computing, including, among others, the following areas of interest: Logical Systems, such as classical and non-classical logic, constructive logic, categorical logic, modal logic, type theory, feasible maths.... Logical issues in logic programming, knowledge-based systems and automated reasoning; logical issues in knowledge representation, such as non-monotonic reasoning and systems of knowledge and belief; logics and semantics of programming; specification and verification of programs and systems; applications of logic in hardware and VLSI, natural language, concurrent computation, planning, and databases. The bulk of the content is technical scientific papers, although letters, reviews, and discussions, as well as relevant conference reviews, are included.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
