Preferential orders and plausibility measures
Michael Crawley Freund · Journal of Logic and Computation · 1998
It is well known that preferential inference relations can be semantically represented through a smooth order defined on the set of states of a preferential model, but it is also possible to represent them via a preferential order, directly defined on the underlying language. In this paper, we study the link that exists between preferential orders and plausibility measures, and prove that any preferential order can be extended, in a canonical way, into a plausibility measure. This extended order has a natural intrepretation in the infinitary framework of deductive inference operations.