A graded semantics for counterfactuals

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61988987%3A17610%2F21%3AA22023KZ" target="_blank" >RIV/61988987:17610/21:A22023KZ - isvavai.cz</a>

Nalezeny alternativní kódy

RIV/67985807:_____/21:00545760

Výsledek na webu

<a href="https://link.springer.com/article/10.1007/s11229-021-03320-3" target="_blank" >https://link.springer.com/article/10.1007/s11229-021-03320-3</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1007/s11229-021-03320-3" target="_blank" >10.1007/s11229-021-03320-3</a>

Jazyk výsledku

angličtina

Název v původním jazyce

A graded semantics for counterfactuals

Popis výsledku v původním jazyce

This article presents an extension of Lewis' analysis of counterfactuals to a graded framework. Unlike standard graded approaches, which use the probabilistic framework, we employ that of many-valued logics. Our principal goal is to provide an adequate analysis of the main background notion of Lewis' approach - the one of the similarity of possible worlds. We discuss the requirements imposed on the analysis of counterfactuals by the imprecise character of similarity and concentrate in particular on robustness, i.e., the requirement that small changes in the similarity relation should not significantly change the truth value of the counterfactual in question. Our second motivation is related to the logical analysis of natural language: analyzing counterfactuals in the framework of many-valued logics allows us to extend the analysis to counterfactuals that include vague statements. Unlike previous proposals of this kind in the literature, our approach makes it possible to apply gradedness at various levels of the analysis and hence provide a more detailed account of the phenomenon of vagueness in the context of counterfactuals. Finally, our framework admits a novel way of avoiding the Limit Assumption, keeping the core of Lewis' truth condition for counterfactuals unchanged.

Název v anglickém jazyce

A graded semantics for counterfactuals

Popis výsledku anglicky

This article presents an extension of Lewis' analysis of counterfactuals to a graded framework. Unlike standard graded approaches, which use the probabilistic framework, we employ that of many-valued logics. Our principal goal is to provide an adequate analysis of the main background notion of Lewis' approach - the one of the similarity of possible worlds. We discuss the requirements imposed on the analysis of counterfactuals by the imprecise character of similarity and concentrate in particular on robustness, i.e., the requirement that small changes in the similarity relation should not significantly change the truth value of the counterfactual in question. Our second motivation is related to the logical analysis of natural language: analyzing counterfactuals in the framework of many-valued logics allows us to extend the analysis to counterfactuals that include vague statements. Unlike previous proposals of this kind in the literature, our approach makes it possible to apply gradedness at various levels of the analysis and hence provide a more detailed account of the phenomenon of vagueness in the context of counterfactuals. Finally, our framework admits a novel way of avoiding the Limit Assumption, keeping the core of Lewis' truth condition for counterfactuals unchanged.

Druh

J_imp - Článek v periodiku v databázi Web of Science

CEP obor

—

OECD FORD obor

10101 - Pure mathematics

Projekt

Výsledek vznikl pri realizaci vícero projektů. Více informací v záložce Projekty.

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Rok uplatnění

2021

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název periodika

Synthese

ISSN

0039-7857

e-ISSN

1573-0964

Svazek periodika

199

Číslo periodika v rámci svazku

5-6

Stát vydavatele periodika

NL - Nizozemsko

Počet stran výsledku

32

Strana od-do

11963-11994

Kód UT WoS článku

000692436400001

EID výsledku v databázi Scopus

2-s2.0-85114186672