Conditionals Based on Selection Functions, Modal Operators and Probabilities

Methods for probability updating, of which Bayesian conditionalization is the most well-known and widely used, are modeling tools that aim to represent the process of modifying an initial epistemic state, typically represented by a prior probability function P, which is adjusted in light of new information. Notably, updating methods and conditional sentences seem to intuitively share a deep connection, as is evident in the case of conditionalization. The present work contributes to this line of research and aims at shedding new light on the relationship between updating methods and conditional connectives. Departing from previous literature that often focused on a specific type of conditional or a particular updating method, our goal is to prove general results concerning the connection between conditionals and their probabilities. This will allow us to characterize the probabilities of certain conditional connectives and to understand what class of updating procedures can be represented using specific conditional connectives. Broadly, we adopt a general perspective that encompasses a large class of conditionals and a wide range of updating methods, enabling us to prove some general results concerning their interrelation.

Authors

Institutions

Publication Details

Journal
Electronic Proceedings in Theoretical Computer Science
Published
2025-11-25
DOI
https://doi.org/10.4204/eptcs.437.14
Primary Topic
Bayesian Modeling and Causal Inference
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Conditionals Based on Selection Functions, Modal Operators and Probabilities

Lluı́s Godo, Tommaso Flaminio, Gluliano Rosella
Electronic Proceedings in Theoretical Computer Science
Bayesian Modeling and Causal Inference
article

Conditionals Based on Selection Functions, Modal Operators and Probabilities

Lluı́s Godo, Tommaso Flaminio, Gluliano Rosella
article en

Abstract

Methods for probability updating, of which Bayesian conditionalization is the most well-known and widely used, are modeling tools that aim to represent the process of modifying an initial epistemic state, typically represented by a prior probability function P, which is adjusted in light of new information. Notably, updating methods and conditional sentences seem to intuitively share a deep connection, as is evident in the case of conditionalization. The present work contributes to this line of research and aims at shedding new light on the relationship between updating methods and conditional connectives. Departing from previous literature that often focused on a specific type of conditional or a particular updating method, our goal is to prove general results concerning the connection between conditionals and their probabilities. This will allow us to characterize the probabilities of certain conditional connectives and to understand what class of updating procedures can be represented using specific conditional connectives. Broadly, we adopt a general perspective that encompasses a large class of conditionals and a wide range of updating methods, enabling us to prove some general results concerning their interrelation.

Electronic Proceedings in Theoretical Computer ScienceVol. 437
Artificial Intelligence Research Institute (ES), University of Turin (IT)
Ministerio de Ciencia, Innovación y Universidades, European Commission, Horizon 2020 Framework Programme, Agencia Estatal de Investigación
Openalex Percentile: Top 81%
Bayesian Modeling and Causal Inference
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Conditionals Based on Selection Functions, Modal Operators and Probabilities — Lluı́s Godo, Tommaso Flaminio, et al. · Electronic Proceedings in Theoretical Computer Science (2025) | TGRS Research Map | TGRS