Abstract
In solving conditional reasoning problems, reasoners are assumed to compute the probability of the conclusion, conditionalizing first on the categorical premise, giving the knowledge-based component, and conditionalizing then on the conditional-statement premise, from which the assumption-based component is derived. Because reasoners find it difficult to compute the second-step conditionalization except when the conditional-statement premise is found to be related to the result of the first-step conditionalization as for modus ponens or, possibly, for modus tollens, the knowledge-based component generally dominates reasoning performance. After representing all the possible cases in which conditional-argument forms may appear, this approach was found to be consistent with the results from the 3 experiments reported in this study, whereas 2 alternative hypotheses account for only some of the results.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
