Jump to ContentJump to Main Navigation
Intergenerational Justice$
Users without a subscription are not able to see the full content.

Axel Gosseries and Lukas H. Meyer

Print publication date: 2009

Print ISBN-13: 9780199282951

Published to Oxford Scholarship Online: September 2009

DOI: 10.1093/acprof:oso/9780199282951.001.0001

Show Summary Details
Page of

PRINTED FROM OXFORD SCHOLARSHIP ONLINE (www.oxfordscholarship.com). (c) Copyright Oxford University Press, 2020. All Rights Reserved. An individual user may print out a PDF of a single chapter of a monograph in OSO for personal use. date: 24 January 2020

Three Models of Intergenerational Reciprocity

Three Models of Intergenerational Reciprocity

Chapter:
(p.119) 4 Three Models of Intergenerational Reciprocity
Source:
Intergenerational Justice
Author(s):

Axel Gosseries (Contributor Webpage)

Publisher:
Oxford University Press
DOI:10.1093/acprof:oso/9780199282951.003.0005

This chapter explores the specificities, strengths, and weaknesses of the idea of reciprocity as a basis for intergenerational obligations. Three models are presented: descending, ascending, and double reciprocity. Each of these three models is tested against three objections. The first objection asks why having received something from someone would necessarily entail the obligation to give back. The second objection questions the ability of each model to justify the direction of reciprocation. A final objection looks at the extent to which reciprocity-based views adjust the content of our obligation to the fluctuations in population size.

Keywords:   generations, indirect reciprocity, Barry, demo-sensitivity, free-riding

Oxford Scholarship Online requires a subscription or purchase to access the full text of books within the service. Public users can however freely search the site and view the abstracts and keywords for each book and chapter.

Please, subscribe or login to access full text content.

If you think you should have access to this title, please contact your librarian.

To troubleshoot, please check our FAQs , and if you can't find the answer there, please contact us .