We show that the implicational fragment of intuitionism is the weakest logic with a non-trivial probabilistic semantics which satisfies the thesis that the probabilities of conditionals are conditional probabilities. We also show that several logics between intuitionism and classical logic also admit non-trivial probability functions which satisfy that thesis. On the other hand, we also prove that very weak assumptions concerning negation added to the core probability conditions with the restriction that probabilities of conditionals are conditional probabilities are sufficient to (...) trivialize the semantics. (shrink)
Conclusions reached using common sense reasoning from a set of premises are often subsequently revised when additional premises are added. Because we do not always accept previous conclusions in light of subsequent information, common sense reasoning is said to be nonmonotonic. But in the standard formal systems usually studied by logicians, if a conclusion follows from a set of premises, that same conclusion still follows no matter how the premise set is augmented; that is, the consequence relations of standard logics (...) are monotonic. Much recent research in AI has been devoted to the attempt to develop nonmonotonic logics. After some motivational material, we give four formal proofs that there can be no nonmonotonic consequence relation that is characterized by universal constraints on rational belief structures. In other words, a nonmonotonic consequence relation that corresponds to universal principles of rational belief is impossible. We show that the nonmonotonicity of common sense reasoning is a function of the way we use logic, not a function of the logic we use. We give several examples of how nonmonotonic reasoning systems may be based on monotonic logics. (shrink)
Fuzzy logics are systems of logic with infinitely many truth values. Such logics have been claimed to have an extremely wide range of applications in linguistics, computer technology, psychology, etc. In this note, we canvass the known results concerning infinitely many valued logics; make some suggestions for alterations of the known systems in order to accommodate what modern devotees of fuzzy logic claim to desire; and we prove some theorems to the effect that there can be no fuzzy logic which (...) will do what its advocates want. Finally, we suggest ways to accommodate these desires in finitely many valued logics. (shrink)
In [2] Hempel and Oppenheim give a definition of “explanation” for a certain formal language. In [1] Eberle, Kaplan, and Montague prove five theorems demonstrating that the Hempel and Oppenheim definition is not restrictive enough. In [3] Kim proposes two further conditions to supplement the Hempel and Oppenheim definition in order to avoid the objections posed in [1]. In this paper it is shown that the definition of Hempel and Oppenheim supplemented by Kim's conditions is open to a trivialization very (...) analogous to that given in [1]. (shrink)
The usual semantics for the modal systems T, S4, and S5 assumes that the set of possible worlds contains at least one member. Recently versions of these modal systems have been developed in which this assumption is dropped. The systems discussed here are obtained by slightly weakening the liberated versions of T and S4. The semantics does not assume the existence of possible worlds, and the accessibility relation between worlds is only required to be quasi-reflexive instead of reflexive. Completeness and (...) independence results are established. (shrink)
In this paper we examine the thesis that the probability of the conditional is the conditional probability. Previous work by a number of authors has shown that in standard numerical probability theories, the addition of the thesis leads to triviality. We introduce very weak, comparative conditional probability structures and discuss some extremely simple constraints. We show that even in such a minimal context, if one adds the thesis that the probability of a conditional is the conditional probability, then one trivializes (...) the theory. Another way of stating the result is that the conditional of conditional probability cannot be represented in the object language on pain of trivializing the theory. (shrink)
The intuitive notion behind the usual semantics of most systems of modal logic is that of ?possible worlds?. Loosely speaking, an expression is necessary if and only if it holds in all possible worlds; it is possible if and only if it holds in some possible world. Of course, contradictory expressions turn out to hold in no possible worlds, and logically true expressions turn out to hold in every possible world. A method is presented for transforming standard modal systems into (...) systems of modal logic for impossible worlds. To each possible world there corresponds an impossible world such that an expression holds in the impossible world if and only if it does not hold in the possible world. One can then talk about such worlds quite consistently, and there seems to be no logical reason for excluding them from consideration. (shrink)
Almost every formal model of explanation thus far proposed has been demonstrated to be faulty. In this paper, a new model, proposed by Raimo Tuomela, is also demonstrated to be faulty. In particular, one condition of the model is shown to be too restrictive, and another condition of the model is shown to be too permissive.