Let be the set of propositions considered by some rational logician (call her Sue). Further, suppose that is closed under the propositional connectives , , . Here are two related but different preorders on :
- if logically entails .
- if Sue considers at least as likely to be true as is.
Let be the equivalence relation defined by iff and let similarly be defined by iff .
Then we know what type of structure is: since we’re assuming classical logic in this article, it’s a Boolean algebra. What type of structure is ?
We can at least come up with a couple of examples. Since Sue is a perfect logician, it must be that if , then . If Sue is extremely conservative, she may decline to offer opinions about whether one proposition is more likely to be true than another except when she’s forced to by logic. In this case, is equal to and therefore again a Boolean algebra.
In the other extreme, Sue may have opinions about every pair of propositions, making a total ordering. A principal example of this is where is isomorphic to a subset of and Sue’s opinions about the propositions were generated by her assigning a probability to every proposition .
What’s in between on the spectrum from logic to probability? Are there totally ordered structures not isomorphic to or a subset? More ambitiously: every Boolean algebra has operations , , , while has operations , , which play similar roles in the computation of probabilities (note that is partial on ). How are these related and does every structure on the spectrum from logic to probability have analogous operations?
These structures (i.e., structures of the form for some acceptable in a sense to be defined below) were called scales and defined and explored in a very nice paper by Michael Hardy.