Superextension, Modal Assertability, and Hypothetical Discernibility:

L. Vollet
{"title":"Superextension, Modal Assertability, and Hypothetical Discernibility:","authors":"L. Vollet","doi":"10.23925/2316-5278.2022v23i1:e58724","DOIUrl":null,"url":null,"abstract":" \n\n\n\nWe argue that Russell’s treatment of propositions containing non-existent denotations is the prelude of a strategy for discerning the predictive content of any proposition with descriptions (and incomplete symbols), insofar as its indeterminacy is classifiable as a possible extension. We argue, further, that Russell’s theory of propositional functions is dedicated to explaining the discernibility of hypothetical propositions, through representing (what we call) the superextension of assertoric modal propositions. The indeterminacy of the truth of hypothetical propositions is thus paired with a second- order classification condition, expressing its conjectural content as the projected scope of instantiation of a propositional function; which in turn is the superextension of a modal predicate. Russell’s theory is his non-pragmatic answer to the problem of assertability in unstable and uncertain conditions. It involves a sophisticated thesis about the discernibility of complex contents, such as those represented by analogical and approximate denotations (descriptions, fictions, etc.), which classify more than one possibility of instantiation in different modal and intensional contexts. We will conclude this article by testing the assumption that Russell’s theory favors a coherentist theory, seeing that as it admits assertability conditions that are super-mapped in a system, or that derive from different orders of referential layers.\n\n\n","PeriodicalId":206101,"journal":{"name":"Cognitio: Revista de Filosofia","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-11-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Cognitio: Revista de Filosofia","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.23925/2316-5278.2022v23i1:e58724","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

  We argue that Russell’s treatment of propositions containing non-existent denotations is the prelude of a strategy for discerning the predictive content of any proposition with descriptions (and incomplete symbols), insofar as its indeterminacy is classifiable as a possible extension. We argue, further, that Russell’s theory of propositional functions is dedicated to explaining the discernibility of hypothetical propositions, through representing (what we call) the superextension of assertoric modal propositions. The indeterminacy of the truth of hypothetical propositions is thus paired with a second- order classification condition, expressing its conjectural content as the projected scope of instantiation of a propositional function; which in turn is the superextension of a modal predicate. Russell’s theory is his non-pragmatic answer to the problem of assertability in unstable and uncertain conditions. It involves a sophisticated thesis about the discernibility of complex contents, such as those represented by analogical and approximate denotations (descriptions, fictions, etc.), which classify more than one possibility of instantiation in different modal and intensional contexts. We will conclude this article by testing the assumption that Russell’s theory favors a coherentist theory, seeing that as it admits assertability conditions that are super-mapped in a system, or that derive from different orders of referential layers.
超可拓性、模态可断言性和假设可分辨性
我们认为,罗素对包含不存在的外延的命题的处理是一种策略的前奏,这种策略可以辨别任何具有描述(和不完整符号)的命题的预测性内容,因为它的不确定性可以作为一种可能的延伸进行分类。我们进一步论证,罗素的命题函数理论致力于通过表征(我们称之为)断言模态命题的超扩展来解释假言命题的可分辨性。因此,假言命题的真性的不确定性与一个二阶分类条件配对,将其推测的内容表示为一个命题函数实例化的投射范围;这是模态谓词的超扩展。罗素的理论是他对不稳定和不确定条件下的可断言性问题的非实用主义回答。它涉及一个关于复杂内容的可分辨性的复杂论题,例如那些由类比和近似表示(描述,虚构等)表示的内容,这些内容在不同的模态和内涵上下文中分类了不止一种实例化可能性。我们将通过测试罗素的理论支持连贯理论的假设来总结这篇文章,看到它承认系统中超映射的可断言性条件,或者来自不同顺序的参考层。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信