Probabilistic Entailment and a Non-Probabilistic Logic
Katherine M. Knight · Logic Journal of IGPL · 2003
In this paper we present a probabilistic notion of entailment for finite sets of premises, which has classical entailment as a special case, and show that it is well defined; i.e., that the problem of whether a sentence is entailed by a set of premises is computable. Further we present a natural deductive system and prove that it is the strongest deductive system possible without referring to probabilities.