We present a meta-analytic review on the processing of negations in conditional reasoning about affirmation problems (Modus Ponens: “MP”, Affirmation of the Consequent “AC”) and denial problems (Denial of the Antecedent “DA”, and Modus Tollens “MT”). Findings correct previous generalisations about the phenomena. First, the effects of negation in the part of the conditional about which an inference is made, are not constrained to denial problems. These inferential-negation effects are also observed on AC. Second, there generally are reliable effects of (...) a negation in the clause referred to by the categorical premise, and these referred-negation effects are constrained to the logically fallacious AC and DA inferences. All findings are presented and discussed in relation to contemporary mental model (MM) and mental logic (ML) theories. It is argued that a double-negation elimination hypothesis provides a sufficient explanation of inferential-negation effects within both MM theory and ML theory, if the latter is extended by a validating search for counter examples. Both MM and ML theories adhere to a processing scheme that allows them to incorporate an account of referred-negation effects based on the thesis that counter-example frequency is modulated by the scope of a contrast class delineated by a false affirmative. We conclude that MM and ML theories provide adequate processing schemes to accommodate for the explanatory hypotheses, at least in principle. In practice, both approaches remain equivocal as regards the connectivity and interactivity with long-term memory knowledge invoked in generating, manipulating, and testing the mental representations of negative state of affairs. (shrink)

An application of the Method of Analysis of Relational Complexity (MARC) to suppositional reasoning in the knight-knave task is outlined. The task requires testing suppositions derived from statements made by individuals who either always tell the truth or always lie. Relational complexity (RC) is defined as the number of unique entities that need to be processed in parallel to arrive at a solution. A selection of five ternary and five quaternary items were presented to 53 psychology students using a pencil (...) and paper format. A computer-administered version was presented to 50 students. As predicted, quaternary problems were associated with higher error rates and longer response times than ternary problems. The computer-administered form was more difficult than the pencil and paper version of the test. These differences are discussed in terms of RC theory and alternative processing accounts. Together, they indicate that the relational complexity metric is a useful and parsimonious way to quantify complexity of reasoning tasks. (shrink)

Current theories of reasoning such as mental models or mental logic assume a universal cognitive mechanism that underlies human reasoning performance. However, there is evidence that this is not the case, for example, the work of Ford (1995), who found that some people adopted predominantly spatial and some verbal strategies in a syllogistic reasoning task. Using written and think-aloud protocols, the present study confirmed the existence of these individual differences. However, in sharp contrast to Ford, the present study found few (...) differences in reasoning performance between the two groups, in terms of accuracy or type of conclusion generated. Hence, reasoners present an outward appearance of ubiquity, despite underlying differences in reasoning processes. These findings have implications for theoretical accounts of reasoning, and for attempts to model reasoning data. Any comprehensive account needs to account for strategic differences and how these may develop in logically untrained individuals. (shrink)