The Development of Cardinal Extension: From Counting to Exact Equality

被引:0
|
作者
Le, Khuyen N. [1 ]
Schneider, Rose M. [1 ]
Barner, David [1 ]
机构
[1] Univ Calif San Diego, Dept Psychol, McGill Hall 5217,9500 Gilman Dr, La Jolla, CA 92093 USA
基金
美国国家科学基金会;
关键词
number words; number concepts; exact equality; cardinal extension; language development; TO-ONE CORRESPONDENCE; NUMBER WORDS; CONSERVATION; ACQUISITION; 3-YEAR-OLDS; PRESCHOOL; COGNITION; PREDICT;
D O I
10.1037/dev0001922
中图分类号
B844 [发展心理学(人类心理学)];
学科分类号
040202 ;
摘要
Numerate adults know that when two sets are equal, they should be labeled by the same number word. We explored the development of this principle-sometimes called "cardinal extension"-and how it relates to children's other numerical abilities. Experiment 1 revealed that 2- to 5-year-old children who could accurately count large sets often inferred that two equal sets should be labeled with the same number word, unlike children who could not accurately count large sets. However, not all counters made this inference, suggesting that learning to construct and label large sets may be a necessary but not sufficient step in learning how numbers represent exact quantities. Experiment 2 found that children who extended labels to equal sets were not actually sensitive to exact equality and that they often assigned two sets the same label when they were approximately equal, but differed by just one item (violating one-to-one correspondence). These results suggest a gradual, stagelike, process in which children learn to accurately count, learn to extend labels to perceptually similar sets, and then eventually restrict cardinal extension to sets that are exactly equal.
引用
收藏
页数:17
相关论文
共 50 条
  • [42] Exact Methods for Testing the Equality of Proportions for Binary Clustered Data From Otolaryngologic Studies
    Shan, Guogen
    Ma, Changxing
    STATISTICS IN BIOPHARMACEUTICAL RESEARCH, 2014, 6 (01): : 115 - 122
  • [43] Exact Counting and Sampling of Optima for the Knapsack Problem
    Bossek, Jakob
    Neumann, Aneta
    Neumann, Frank
    LEARNING AND INTELLIGENT OPTIMIZATION, LION 15, 2021, 12931 : 40 - 54
  • [44] On the complexity of exact counting of dynamically irreducible polynomials
    Gomez-Perez, Domingo
    Merai, Laszlo
    Shparlinski, Igor E.
    JOURNAL OF SYMBOLIC COMPUTATION, 2020, 99 : 231 - 241
  • [45] Exact counting of supersymmetric black hole microstates
    Dabholkar, A
    PHYSICAL REVIEW LETTERS, 2005, 94 (24)
  • [46] Improving Exact Solution Counting for Decomposition Methods
    Jegou, Philippe
    Kanso, Hanan
    Terrioux, Cyril
    2016 IEEE 28TH INTERNATIONAL CONFERENCE ON TOOLS WITH ARTIFICIAL INTELLIGENCE (ICTAI 2016), 2016, : 327 - 334
  • [47] High Performance Exact Triangle Counting on GPUs
    Bisson, Mauro
    Fatica, Massimiliano
    IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2017, 28 (12) : 3501 - 3510
  • [48] Exact and Parallel Triangle Counting in Dynamic Graphs
    Makkar, Devavret
    Bader, David A.
    Green, Oded
    2017 IEEE 24TH INTERNATIONAL CONFERENCE ON HIGH PERFORMANCE COMPUTING (HIPC), 2017, : 2 - 12
  • [49] EQUALITY OF CARDINAL NUMBERS OF MINIMAL GENERATORS UNDER STRONG SPANS - PRELIMINARY REPORT
    HALL, J
    NOTICES OF THE AMERICAN MATHEMATICAL SOCIETY, 1971, 18 (01): : 99 - &
  • [50] COUNTING BY RACE - EQUALITY FROM THE FOUNDING FATHERS TO BAKKE AND WEBER - EASTLAND,T, BENNETT,WJ
    NUECHTERLEIN, JA
    COMMENTARY, 1980, 69 (03) : 86 - 88