Show Summary Details

Page of

PRINTED FROM OXFORD HANDBOOKS ONLINE (www.oxfordhandbooks.com). © 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 March 2019

Abstract and Keywords

Transitive inference (TI) is a form of deductive reasoning that allows one to derive a relation between items that have not been explicitly compared before. In a general form, TI is the ability to deduce that if Item B is related to Item C and Item C is related to Item D, then Item B must be related to Item D. This chapter begins with discussions of the methodology of nonverbal TI research, followed by problems in interpreting the results of TI research. It reviews cognitive and reinforcement-based models of TI and considers research on neurobiological mechanisms of nonverbal inferences. It shows that with the single exception of honey bees, every species tested so far has been found to exhibit transitive-like behavior in an n-term series task. Whether this overwhelming incidence of success means that animals truly make inferences, however, has been a matter of a considerable debate that continues to this day. The author concludes that current experimental evidence does not strongly support either cognitive models or reinforcement-based models of TI.

Keywords: transitive inference, deductive reasoning, nonhuman animals, associative models

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.