By and large, the conditional connective in three-valued logic has two different functions. First, by means of a deduction theorem, it can express a specific relation of logical consequence in the logical language itself. Second, it can represent natural language structures such as "if/then'' or "implies''. This chapter surveys both approaches, shows why none of them will typically end up with a three-valued material conditional, and elaborates on connections to probabilistic reasoning.

Different inferences in probabilistic logics of conditionals 'preserve' the probabilities of their premisses to different degrees. Some preserve certainty, some high probability, some positive probability, and some minimum probability. In the first case conclusions must have probability I when premisses have probability 1, though they might have probability 0 when their premisses have any lower probability. In the second case, roughly speaking, if premisses are highly probable though not certain then conclusions must also be highly probable. In the third case (...) conclusions must have positive probability when premisses do, and in the last case conclusions must be at least as probable as their least probable premisses. Precise definitions and well known examples are given for each of these properties, characteristic principles are shown to be valid and complete for deriving conclusions of each of these kinds, and simple trivalent truthtable 'tests' are described for determining which properties are possessed by any given inference. Brief comments are made on the application of these results to certain modal inferences such as "Jones may own a car, and if he does he will have a driver's license. Therefore, he may have a driver's license.". (shrink)

Three-valued accounts of conditionals frequently promise (a) to conform to the probabilistic view that conditionals are evaluated by conditional probabilities, and (b) to yield a plausible account of compounds of conditionals. However, McGee (1981) shows that probabilistic validity, the conception of validity most naturally associated with the probabilistic view, cannot be characterized by a finite matrix. Adams (1995) indicates a further generalization of this result. Nevertheless, Adams (1986) provides a description of probabilistic validity in three-valued terms by going beyond the (...) standard framework. Yet the language Adams considers is severely restricted: it does not contain compounds of conditionals. Thus, a natural question arises: Is there a plausible three-valued account of compounds of conditionals which agrees with probabilistic validity on the restricted language? In this note, I develop a general framework in which to address this question. The answer will be negative. (shrink)