Show Summary Details

Page of

PRINTED FROM OXFORD HANDBOOKS ONLINE ( © Oxford University Press, 2018. All Rights Reserved. Under the terms of the licence agreement, an individual user may print out a PDF of a single chapter of a title in Oxford Handbooks Online for personal use (for details see Privacy Policy and Legal Notice).

date: 25 February 2021

Abstract and Keywords

Objects, events, and places in the world are related to each other in systematic ways. As a result, mechanisms and processes in the nervous system have evolved that allow these relationships to be detected and used in adaptive ways. In this context, the study of learning can be understood as the study of the mechanisms that allow systematicity in the world to affect behavior. This chapter is concerned with systematic spatial relationships among the elements of a set of locations containing hidden goals. It suggests a system for the formation of representations of systematic spatial relations among hidden goals that would be of value when hidden resources have some systematic spatial distribution. The system may, however, be one expression of more general pattern-recognition mechanisms that detect patterns over a variety of dimensions, including serial and temporal patterns. Regardless of its relationship to other forms of pattern learning, spatial pattern learning appears to be somewhat isolated from the spatial learning processes that rely on visual or other sensory cues to specify the location of goals.

Keywords: spatial learning, spatial performance, hidden goals, spatial pattern learning

Access to the complete content on Oxford Handbooks Online requires a subscription or purchase. Public users are able to search the site and view the abstracts and keywords for each book and chapter without a subscription.

Please subscribe or login to access full text content.

If you have purchased a print title that contains an access token, please see the token for information about how to register your code.

For questions on access or troubleshooting, please check our FAQs, and if you can''t find the answer there, please contact us.