In logic, a rational consequence relation is a non-monotonic consequence relation satisfying certain properties listed below.
Contents
Properties
A rational consequence relation satisfies:
and the so-called Gabbay-Makinson rules:
Uses
The rational consequence relation is non-monotonic, and the relation
Example
The statement "If a cake contains sugar then it tastes good" implies under a monotone consequence relation the statement "If a cake contains sugar and soap then it tastes good." Clearly this doesn't match our own understanding of cakes. By asserting "If a cake contains sugar then it usually tastes good" a rational consequence relation allows for a more realistic model of the real world, and certainly it does not automatically follow that "If a cake contains sugar and soap then it usually tastes good."
Note that if we also have the information "If a cake contains sugar then it usually contains butter" then we may legally conclude (under CMO) that "If a cake contains sugar and butter then it usually tastes good.". Equally in the absence of a statement such as "If a cake contains sugar then usually it contains no soap" then we may legally conclude from RMO that "If the cake contains sugar and soap then it usually tastes good."
If this latter conclusion seems ridiculous to you then it is likely that you are subconsciously asserting your own preconceived knowledge about cakes when evaluating the validity of the statement. That is, from your experience you know that cakes which contain soap are likely to taste bad so you add to the system your own knowledge such as "Cakes which contain sugar do not usually contain soap.", even though this knowledge is absent from it. If the conclusion seems silly to you then you might consider replacing the word soap with the word eggs to see if it changes your feelings.
Example
Consider the sentences:
We may consider it reasonable to conclude:
This would not be a valid conclusion under a monotonic deduction system (omitting of course the word 'usually'), since the third sentence would contradict the first two. In contrast the conclusion follows immediately using the Gabbay-Makinson rules: applying the rule CMO to the last two sentences yields the result.
Consequences
The following consequences follow from the above rules:
The representation theorem
It can be proven that any rational consequence relation on a finite language is representable via a sequence of atom preferences above. That is, for any such rational consequence relation
Notes
- By the above property of
⊢ s → ⊢ need not be unique - if thes i