Counterfactual analysis by algorithmic complexity: a metric between possible worlds
Autor(a) principal: | |
---|---|
Data de Publicação: | 2023 |
Outros Autores: | |
Tipo de documento: | Artigo |
Idioma: | eng |
Título da fonte: | Manuscrito (Online) |
Texto Completo: | https://periodicos.sbu.unicamp.br/ojs/index.php/manuscrito/article/view/8672704 |
Resumo: | Counterfactuals have become an important area of interdisciplinary interest, especially in logic, philosophy of language, epistemology, metaphysics, psychology, decision theory, and even artificial intelligence. In this study, we propose a new form of analysis for counterfactuals: analysis by algorithmic complexity. Inspired by Lewis-Stalnaker's Possible Worlds Semantics, the proposed method allows for a new interpretation of the debate between David Lewis and Robert Stalnaker regarding the Limit and Singularity assumptions. Besides other results, we offer a new way to answer the problems raised by Goodman and Quine regarding vagueness, context-dependence, and the non- monotonicity of counterfactuals. Engaging in a dialogue with literature, this study will seek to bring new insights and tools to this debate. We hope our method of analysis can make counterfactuals more understandable in an intuitively plausible way, and a philosophically justifiable manner, aligned with the way we usually think about counterfactual propositions and our imaginative reasoning. |
id |
UNICAMP-17_2b969dade7b2c29cdb343af336198621 |
---|---|
oai_identifier_str |
oai:ojs.periodicos.sbu.unicamp.br:article/8672704 |
network_acronym_str |
UNICAMP-17 |
network_name_str |
Manuscrito (Online) |
repository_id_str |
|
spelling |
Counterfactual analysis by algorithmic complexity: a metric between possible worldsCounterfactual analysis by algorithmic complexity: a metric between possible worldsCounterfactual analysis by algorithmic complexity: a metric between possible worldsAlgorithmic complexityCounterfactualsPossible world semanticsSimilarity functionComplicación algorítmicaContrafactualesSemántica del mundo posibleFunción de similitudComplexidade algorítmicaContrafactualidadesPossível semântica mundialFunção de similaridadeCounterfactuals have become an important area of interdisciplinary interest, especially in logic, philosophy of language, epistemology, metaphysics, psychology, decision theory, and even artificial intelligence. In this study, we propose a new form of analysis for counterfactuals: analysis by algorithmic complexity. Inspired by Lewis-Stalnaker's Possible Worlds Semantics, the proposed method allows for a new interpretation of the debate between David Lewis and Robert Stalnaker regarding the Limit and Singularity assumptions. Besides other results, we offer a new way to answer the problems raised by Goodman and Quine regarding vagueness, context-dependence, and the non- monotonicity of counterfactuals. Engaging in a dialogue with literature, this study will seek to bring new insights and tools to this debate. We hope our method of analysis can make counterfactuals more understandable in an intuitively plausible way, and a philosophically justifiable manner, aligned with the way we usually think about counterfactual propositions and our imaginative reasoning.Los contrafácticos se han convertido en una importante área de interés interdisciplinar, especialmente en lógica, filosofía del lenguaje, epistemología, metafísica, psicología, teoría de la decisión e incluso inteligencia artificial. En este estudio, proponemos una nueva forma de análisis para los contrafácticos: el análisis por complejidad algorítmica. Inspirado en la Semántica de los Mundos Posibles de Lewis-Stalnaker, el método propuesto permite una nueva interpretación del debate entre David Lewis y Robert Stalnaker sobre los supuestos de Límite y Singularidad. Además de otros resultados, ofrecemos una nueva forma de responder a los problemas planteados por Goodman y Quine en relación con la vaguedad, la dependencia del contexto y la no monotonicidad de los contrafácticos. Entablando un diálogo con la literatura, este estudio tratará de aportar nuevas ideas y herramientas a este debate. Esperamos que nuestro método de análisis pueda hacer más comprensibles los contrafácticos de una manera intuitivamente plausible y filosóficamente justificable, en consonancia con la forma en que solemos pensar sobre las proposiciones contrafácticas y nuestro razonamiento imaginativo.Os contrafactuais tornaram-se uma importante área de interesse interdisciplinar, especialmente em lógica, filosofia da linguagem, epistemologia, metafísica, psicologia, teoria da decisão, e até mesmo inteligência artificial. Neste estudo, propomos uma nova forma de análise para os contrafactuais: a análise por complexidade algorítmica. Inspirado na Semântica dos Mundos Possíveis de Lewis-Stalnaker, o método proposto permite uma nova interpretação do debate entre David Lewis e Robert Stalnaker sobre as suposições de Limite e Singularidade. Além de outros resultados, oferecemos uma nova forma de responder aos problemas levantados por Goodman e Quine em relação à indefinição, dependência do contexto e a não monotonicidade dos contrafatuais. Dialogando com a literatura, este estudo procurará trazer novas idéias e ferramentas para este debate. Esperamos que nosso método de análise possa tornar os contrafactuais mais compreensíveis de uma forma intuitivamente plausível, e uma maneira filosoficamente justificável, alinhada com a maneira como geralmente pensamos sobre as propostas contrafactuais e nosso raciocínio imaginativo.Universidade Estadual de Campinas2023-03-10info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionTextoTextoinfo:eu-repo/semantics/otherapplication/pdfhttps://periodicos.sbu.unicamp.br/ojs/index.php/manuscrito/article/view/8672704Manuscrito: International Journal of Philosophy; Vol. 45 No. 4 (2022): Oct./Dec.; 1-35Manuscrito: Revista Internacional de Filosofía; Vol. 45 Núm. 4 (2022): Oct./Dec.; 1-35Manuscrito: Revista Internacional de Filosofia; v. 45 n. 4 (2022): Oct./Dec.; 1-352317-630Xreponame:Manuscrito (Online)instname:Universidade Estadual de Campinas (UNICAMP)instacron:UNICAMPenghttps://periodicos.sbu.unicamp.br/ojs/index.php/manuscrito/article/view/8672704/31522Brazil; ContemporaryBrasil; ContemporáneoBrasil; ContemporâneoCopyright (c) 2022 Manuscrito: Revista Internacional de Filosofiahttps://creativecommons.org/licenses/by-nc/4.0info:eu-repo/semantics/openAccessCorrêa, NicholasOliveira, Nythamar fernandes de2024-03-07T14:35:25Zoai:ojs.periodicos.sbu.unicamp.br:article/8672704Revistahttps://periodicos.sbu.unicamp.br/ojs/index.php/manuscritoPUBhttps://periodicos.sbu.unicamp.br/ojs/index.php/manuscrito/oaimwrigley@cle.unicamp.br|| dascal@spinoza.tau.ac.il||publicacoes@cle.unicamp.br2317-630X0100-6045opendoar:2024-03-07T14:35:25Manuscrito (Online) - Universidade Estadual de Campinas (UNICAMP)false |
dc.title.none.fl_str_mv |
Counterfactual analysis by algorithmic complexity: a metric between possible worlds Counterfactual analysis by algorithmic complexity: a metric between possible worlds Counterfactual analysis by algorithmic complexity: a metric between possible worlds |
title |
Counterfactual analysis by algorithmic complexity: a metric between possible worlds |
spellingShingle |
Counterfactual analysis by algorithmic complexity: a metric between possible worlds Corrêa, Nicholas Algorithmic complexity Counterfactuals Possible world semantics Similarity function Complicación algorítmica Contrafactuales Semántica del mundo posible Función de similitud Complexidade algorítmica Contrafactualidades Possível semântica mundial Função de similaridade |
title_short |
Counterfactual analysis by algorithmic complexity: a metric between possible worlds |
title_full |
Counterfactual analysis by algorithmic complexity: a metric between possible worlds |
title_fullStr |
Counterfactual analysis by algorithmic complexity: a metric between possible worlds |
title_full_unstemmed |
Counterfactual analysis by algorithmic complexity: a metric between possible worlds |
title_sort |
Counterfactual analysis by algorithmic complexity: a metric between possible worlds |
author |
Corrêa, Nicholas |
author_facet |
Corrêa, Nicholas Oliveira, Nythamar fernandes de |
author_role |
author |
author2 |
Oliveira, Nythamar fernandes de |
author2_role |
author |
dc.contributor.author.fl_str_mv |
Corrêa, Nicholas Oliveira, Nythamar fernandes de |
dc.subject.por.fl_str_mv |
Algorithmic complexity Counterfactuals Possible world semantics Similarity function Complicación algorítmica Contrafactuales Semántica del mundo posible Función de similitud Complexidade algorítmica Contrafactualidades Possível semântica mundial Função de similaridade |
topic |
Algorithmic complexity Counterfactuals Possible world semantics Similarity function Complicación algorítmica Contrafactuales Semántica del mundo posible Función de similitud Complexidade algorítmica Contrafactualidades Possível semântica mundial Função de similaridade |
description |
Counterfactuals have become an important area of interdisciplinary interest, especially in logic, philosophy of language, epistemology, metaphysics, psychology, decision theory, and even artificial intelligence. In this study, we propose a new form of analysis for counterfactuals: analysis by algorithmic complexity. Inspired by Lewis-Stalnaker's Possible Worlds Semantics, the proposed method allows for a new interpretation of the debate between David Lewis and Robert Stalnaker regarding the Limit and Singularity assumptions. Besides other results, we offer a new way to answer the problems raised by Goodman and Quine regarding vagueness, context-dependence, and the non- monotonicity of counterfactuals. Engaging in a dialogue with literature, this study will seek to bring new insights and tools to this debate. We hope our method of analysis can make counterfactuals more understandable in an intuitively plausible way, and a philosophically justifiable manner, aligned with the way we usually think about counterfactual propositions and our imaginative reasoning. |
publishDate |
2023 |
dc.date.none.fl_str_mv |
2023-03-10 |
dc.type.driver.fl_str_mv |
info:eu-repo/semantics/article info:eu-repo/semantics/publishedVersion Texto Texto info:eu-repo/semantics/other |
format |
article |
status_str |
publishedVersion |
dc.identifier.uri.fl_str_mv |
https://periodicos.sbu.unicamp.br/ojs/index.php/manuscrito/article/view/8672704 |
url |
https://periodicos.sbu.unicamp.br/ojs/index.php/manuscrito/article/view/8672704 |
dc.language.iso.fl_str_mv |
eng |
language |
eng |
dc.relation.none.fl_str_mv |
https://periodicos.sbu.unicamp.br/ojs/index.php/manuscrito/article/view/8672704/31522 |
dc.rights.driver.fl_str_mv |
Copyright (c) 2022 Manuscrito: Revista Internacional de Filosofia https://creativecommons.org/licenses/by-nc/4.0 info:eu-repo/semantics/openAccess |
rights_invalid_str_mv |
Copyright (c) 2022 Manuscrito: Revista Internacional de Filosofia https://creativecommons.org/licenses/by-nc/4.0 |
eu_rights_str_mv |
openAccess |
dc.format.none.fl_str_mv |
application/pdf |
dc.coverage.none.fl_str_mv |
Brazil; Contemporary Brasil; Contemporáneo Brasil; Contemporâneo |
dc.publisher.none.fl_str_mv |
Universidade Estadual de Campinas |
publisher.none.fl_str_mv |
Universidade Estadual de Campinas |
dc.source.none.fl_str_mv |
Manuscrito: International Journal of Philosophy; Vol. 45 No. 4 (2022): Oct./Dec.; 1-35 Manuscrito: Revista Internacional de Filosofía; Vol. 45 Núm. 4 (2022): Oct./Dec.; 1-35 Manuscrito: Revista Internacional de Filosofia; v. 45 n. 4 (2022): Oct./Dec.; 1-35 2317-630X reponame:Manuscrito (Online) instname:Universidade Estadual de Campinas (UNICAMP) instacron:UNICAMP |
instname_str |
Universidade Estadual de Campinas (UNICAMP) |
instacron_str |
UNICAMP |
institution |
UNICAMP |
reponame_str |
Manuscrito (Online) |
collection |
Manuscrito (Online) |
repository.name.fl_str_mv |
Manuscrito (Online) - Universidade Estadual de Campinas (UNICAMP) |
repository.mail.fl_str_mv |
mwrigley@cle.unicamp.br|| dascal@spinoza.tau.ac.il||publicacoes@cle.unicamp.br |
_version_ |
1800216565178695680 |