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: 18 November 2019

Abstract and Keywords

Given the definitions of lying and self-deception, it would be wrong to understand self-deception as lying to oneself. It seems, however, that any definition of self-deception gives rise to two paradoxes. According to the ‘static paradox’, self-deception involves believing ‘p and not-p’ at the same time. According to the ‘dynamic paradox’, self-deception involves the intention to deceive oneself. If both claims were true, self-deception would seem to be impossible. ‘Divisionists’ try to solve the first paradox by arguing that the human mind is divided into several subsystems such that the self-deceiver consciously believes that p while unconsciously believing that not-p. ‘Non-intentionalists’ try to solve the second paradox by arguing that self-deception is based on a ‘motivational bias’. Since both explanations fall short of accounting for the blameworthiness of self-deception, a third approach examines the phenomenon from the perspective of virtue theory, claiming that self-deceivers have not yet succeeded in developing the virtue of accuracy.

Keywords: accuracy, biased belief, dynamic paradox, intentionality condition, knowledge condition, lying to oneself, partitioning, self-deception, static paradox, virtue

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.