This paper deals with many valued case of modus ponens. Cases with implicative and with clausal rules are studied. Many valued modus ponens via discrete connectives is studied with implicative rules as well as with clausal rules. Some properties of discrete modus ponens operator are given.
An important field of probability logic is the investigation of inference rules that propagate point probabilities or, more generally, interval probabilities from premises to conclusions. Conditional probability logic (CPL) interprets the common sense expressions of the form "if \dots, then \dots" by conditional probabilities and not by the probability of the material implication. An inference rule is \emph{probabilistically informative} if the coherent probability interval of its conclusion is not necessarily equal to the unit interval [0,1]. Not all logically valid inference rules are probabilistically informative and vice versa. The relationship between logically valid and probabilistically informative inference rules is discussed and illustrated by examples such as the {\sc modus ponens} or the {\sc affirming the consequent}. We propose a method to evaluate the strength of CPL inference rules. Finally, an example of a proof is given that is purely based on CPL inference rules.