<p>Naive set theory, as practiced in the nineteenth century by Cantor, Dedekind, and Frege, consists of two basic principles: <i>extensionality</i> and <i>naive comprehension</i>. According to the latter, <i>every</i> condition determines a set. This is usually formalized by the schema <InlineEquation ID="IEq1"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11229_2024_4797_Article_IEq1.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="155" /> </InlineMediaObject> <EquationSource Format="TEX">\(\exists y \forall x\, (x \in y \leftrightarrow A(x))\)</EquationSource> </InlineEquation>, where <InlineEquation ID="IEq100"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11229_2024_4797_Article_IEq100.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="36" /> </InlineMediaObject> <EquationSource Format="TEX">\(A(x)\)</EquationSource> </InlineEquation> is any condition on <InlineEquation ID="IEq200"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11229_2024_4797_Article_IEq200.gif" Format="GIF" Height="10" Rendition="HTML" Resolution="72" Type="Linedraw" Width="13" /> </InlineMediaObject> <EquationSource Format="TEX">\(x\)</EquationSource> </InlineEquation> in which <InlineEquation ID="IEq201"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11229_2024_4797_Article_IEq201.gif" Format="GIF" Height="12" Rendition="HTML" Resolution="72" Type="Linedraw" Width="13" /> </InlineMediaObject> <EquationSource Format="TEX">\(y\)</EquationSource> </InlineEquation> doesn’t occur free. Some philosophers have argued that, since this restriction is in place to avoid paradox, in a logic weak enough to handle paradoxes, the restriction on <InlineEquation ID="IEq101"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11229_2024_4797_Article_IEq101.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="36" /> </InlineMediaObject> <EquationSource Format="TEX">\(A(x)\)</EquationSource> </InlineEquation> should be lifted in order to better capture the full generality of naive comprehension. I argue that, on the contrary, lifting the restriction doesn’t do more justice to naive comprehension but is the product of a serious misunderstanding of what the principle really says.</p>

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Against generalized comprehension

  • Lavinia Picollo

摘要

Naive set theory, as practiced in the nineteenth century by Cantor, Dedekind, and Frege, consists of two basic principles: extensionality and naive comprehension. According to the latter, every condition determines a set. This is usually formalized by the schema \(\exists y \forall x\, (x \in y \leftrightarrow A(x))\) , where \(A(x)\) is any condition on \(x\) in which \(y\) doesn’t occur free. Some philosophers have argued that, since this restriction is in place to avoid paradox, in a logic weak enough to handle paradoxes, the restriction on \(A(x)\) should be lifted in order to better capture the full generality of naive comprehension. I argue that, on the contrary, lifting the restriction doesn’t do more justice to naive comprehension but is the product of a serious misunderstanding of what the principle really says.