Ordinal Conditional Functions for Nearly Counterfactual Revision

03/31/2016
by   Aaron Hunter, et al.
0

We are interested in belief revision involving conditional statements where the antecedent is almost certainly false. To represent such problems, we use Ordinal Conditional Functions that may take infinite values. We model belief change in this context through simple arithmetical operations that allow us to capture the intuition that certain antecedents can not be validated by any number of observations. We frame our approach as a form of finite belief improvement, and we propose a model of conditional belief revision in which only the "right" hypothetical levels of implausibility are revised.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset