We investigated whether a basic deductive inference, namely the modus ponens, is an automatic processing step carried out even in the absence of willingness to reason and awareness of all the premises. We used an exhaustive set of conditional problems concerning numbers, with a subliminal second premise, followed by a target number. Participants evaluated whether the target number was odd or ev...

Conditional deduction in binary logic basically consists of deriving new statements from an existing set of statements and conditional rules. Modus Ponens, which is the classical example of a conditional deduction rule, expresses a conditional relationship between an antecedent and a consequent. A generalisation of Modus Ponens to probabilities in the form of probabilistic conditional inference...

[ Abstract.] The paper contains some considerations concerning the relationship between decision rules and inference rules from the rough set theory perspective. It is shown that decision rules can be interpreted as a generalization of the modus ponens inference rule, however there is an essential difference between these two concepts. Decision rules in the rough set approach are used to descri...

Modus Ponens is a key property for fuzzy implication functions that are going to be used in fuzzy inference processes. In this paper it is investigated when fuzzy implication functions derived from uninorms via residuation, usually called RU implications, satisfy the modus ponens with respect to a continuous t-norm T , or equivalently, when they are T -conditionals. For RU -implications it is p...

We will begin by defining some logical connectives. The first logical connective is implication. Luckily, implication is already built in to the Haskell type system in the form of arrow types. The type p -> q is equivalent to the logical statement P → Q. We can now prove a very simple theorem called Modus Ponens. Modus Ponens states that if P implies Q and P is true, then Q is true. It is often...