How to eliminate illusions in quantified reasoning

被引:0
|
作者
Yingrui Yang
P. N. Johnson-Laird
机构
[1] Princeton University,Department of Psychology
来源
Memory & Cognition | 2000年 / 28卷
关键词
Control Problem; Mental Model; Remedial Instruction; Mental Model Theory; Plastic Bead;
D O I
暂无
中图分类号
学科分类号
摘要
The mental model theory postulates that reasoners build models of situations described in premises. These models normally make explicit only what is true according to the premises. The theory has an unexpected consequence. It predicts the existence ofillusions in inferences: Certain inferences should have compelling but erroneous conclusions. Previous studies have corroborated the existence of such illusions. The present study reports the first effective antidote to them. For example, most people incorrectly answer “yes” to the following problem:Only one of the following statements is true . . . /At least some of the plastic beads are not red. /None of the plastic beads are red. /Is it possible that none of the red beads are plastic? In two experiments, we progressively eliminated this fallacy and others by using instructions designed to overcome the bias toward truth. The difference between the illusory and the control problems disappeared when the participants were instructed to work out both the case in which the first premise was true and the second premise was false and the case in which the second premise was true and the first premise was false.
引用
收藏
页码:1050 / 1059
页数:9
相关论文
共 50 条
  • [21] Automated reasoning in quantified modal and temporal logics
    Castellini, Claudio
    [J]. AI COMMUNICATIONS, 2006, 19 (02) : 183 - 185
  • [22] Superposition Reasoning about Quantified Bitvector Formulas
    Damestani, David
    Kovacs, Laura
    Suda, Martin
    [J]. 2019 21ST INTERNATIONAL SYMPOSIUM ON SYMBOLIC AND NUMERIC ALGORITHMS FOR SCIENTIFIC COMPUTING (SYNASC 2019), 2020, : 95 - 99
  • [23] A Structural Approach to Reasoning with Quantified Boolean Formulas
    Pulina, Luca
    Tacchella, Armando
    [J]. 21ST INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE (IJCAI-09), PROCEEDINGS, 2009, : 596 - 602
  • [24] REASONING WITH FUZZY QUANTIFIED STATEMENTS .2.
    YAGER, RR
    [J]. KYBERNETES, 1986, 15 (02) : 111 - 120
  • [25] How to Eliminate a Graph
    Golovach, Petr A.
    Heggernes, Pinar
    van 't Hof, Pim
    Manne, Fredrik
    Paulusma, Daniel
    Pilipczuk, Micha L.
    [J]. GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, 2012, 7551 : 320 - 331
  • [26] Representing paraconsistent reasoning via quantified propositional logic
    Besnard, P
    Schaub, T
    Tompits, H
    Woltran, S
    [J]. INCONSISTENCY TOLERANCE, 2004, 3300 : 84 - 118
  • [27] How I Quantified Myself
    Waltz, Emily
    [J]. IEEE SPECTRUM, 2012, 49 (09) : 42 - 47
  • [28] HOW IS HAIR GEL QUANTIFIED?
    Pitt, Mark A.
    Myung, Jay I.
    [J]. CONNECTIONIST MODELS OD NEUROCOGNITION AND EMERGENT BEHAVIOR: FROM THEORY TO APPLICATIONS, 2012, 20 : 356 - 360
  • [29] Paraconsistent preferential reasoning by signed quantified Boolean formulae
    Arieli, O
    [J]. ECAI 2004: 16TH EUROPEAN CONFERENCE ON ARTIFICIAL INTELLIGENCE, PROCEEDINGS, 2004, 110 : 773 - 777
  • [30] Reasoning in Argumentation Frameworks Using Quantified Boolean Formulas
    Egly, Uwe
    Woltran, Stefan
    [J]. COMPUTATIONAL MODELS OF ARGUMENT, 2006, 144 : 133 - 144