Abstract
The abstract logical structure of family relationship problems, such as, “What relationship to a man is his mother's father?” was described in terms of a “distinctive-feature-transition count (dft)”, where the answer to the problem was characterized in terms of the distinctive features of descendancy, co-linearity, and sex. On average, it proved possible to predict the difficulty of such problems from such a count; thus tending to support the idea of a relational rather than an associative memory structure.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.