More about plausibility orderings (Q1060937)

Let S be a finite set of statements, with A and B subsets. Let \(\geq\) be a binary relation over the power set of S, which is connected, transitive, and independent. \(A\geq B\) means A is at least as plausible as B. This paper extends \(\geq\) to implausible statements, i.e. statements less plausible than the empty set.