“一般设置中的不完整性”的勘误表

IF 0.7 3区数学 Q1 LOGIC

Bulletin of Symbolic Logic Pub Date : 2008-03-01 DOI:10.2178/BSL/1208358848

J. Bell

{"title":"“一般设置中的不完整性”的勘误表","authors":"J. Bell","doi":"10.2178/BSL/1208358848","DOIUrl":null,"url":null,"abstract":"It has been pointed out to me by a reviewer that the definition of Peano assemblage given in example 1 on p. 24 of my paper “Incompleteness in a General Setting” [1] is flawed. Unfortunately I overlooked the fact that Gödel numbering cannot be automatically extended to equivalence classes of formulas under provability so as to preserve the recursive nature of the coding. A corrected version of the paper is available on my website at http://publish.uwo.ca/~jbell/.","PeriodicalId":55307,"journal":{"name":"Bulletin of Symbolic Logic","volume":"14 1","pages":"122 - 122"},"PeriodicalIF":0.7000,"publicationDate":"2008-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Corrigendum to “Incompleteness in a General Setting”\",\"authors\":\"J. Bell\",\"doi\":\"10.2178/BSL/1208358848\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"It has been pointed out to me by a reviewer that the definition of Peano assemblage given in example 1 on p. 24 of my paper “Incompleteness in a General Setting” [1] is flawed. Unfortunately I overlooked the fact that Gödel numbering cannot be automatically extended to equivalence classes of formulas under provability so as to preserve the recursive nature of the coding. A corrected version of the paper is available on my website at http://publish.uwo.ca/~jbell/.\",\"PeriodicalId\":55307,\"journal\":{\"name\":\"Bulletin of Symbolic Logic\",\"volume\":\"14 1\",\"pages\":\"122 - 122\"},\"PeriodicalIF\":0.7000,\"publicationDate\":\"2008-03-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Bulletin of Symbolic Logic\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.2178/BSL/1208358848\",\"RegionNum\":3,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"LOGIC\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Bulletin of Symbolic Logic","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.2178/BSL/1208358848","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"LOGIC","Score":null,"Total":0}

引用次数: 0

摘要

一位审稿人向我指出，我的论文“一般设置中的不完备性”(Incompleteness in a General Setting)[1]第24页示例1中给出的Peano集合的定义是有缺陷的。不幸的是，我忽略了一个事实，即Gödel编号不能在可证明性下自动扩展到公式的等价类，以保持编码的递归性质。论文的更正版可以在我的网站http://publish.uwo.ca/~jbell/上找到。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Corrigendum to “Incompleteness in a General Setting”

It has been pointed out to me by a reviewer that the definition of Peano assemblage given in example 1 on p. 24 of my paper “Incompleteness in a General Setting” [1] is flawed. Unfortunately I overlooked the fact that Gödel numbering cannot be automatically extended to equivalence classes of formulas under provability so as to preserve the recursive nature of the coding. A corrected version of the paper is available on my website at http://publish.uwo.ca/~jbell/.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Bulletin of Symbolic Logic 数学-数学

CiteScore

0.60

自引率

0.00%

发文量

审稿时长

>12 weeks

期刊介绍： The Bulletin of Symbolic Logic was established in 1995 by the Association for Symbolic Logic to provide a journal of high standards that would be both accessible and of interest to as wide an audience as possible. It is designed to cover all areas within the purview of the ASL: mathematical logic and its applications, philosophical and non-classical logic and its applications, history and philosophy of logic, and philosophy and methodology of mathematics.