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: 10 December 2019

Abstract and Keywords

A problem (problêma) is posed: Is pleasure choiceworthy, or not? The answerer claims that yes, it is (or, alternatively, that no, it is not). The questioner must refute him by asking questions—by offering him premises (protaseis) to accept or reject. The questioner succeeds if he forces the answerer to accept a proposition contrary to the one he undertook to defend, and fails if the answerer always accepts or rejects premises in a way consistent with that proposition. To a first approximation, dialectic is the distinctive method of Aristotelian philosophy. At the heart of dialectic is the dialectical deduction (dialektikos sullogismos). This article discusses Aristotle's philosophical method, focusing on dialectical premises, endoxa (reputable beliefs), and aporiai (puzzles). It also examines the uses of dialectic in intellectual training (gumnasia), ordinary discussion (enteuxeis), and the philosophical sciences, as well as in regard to scientific starting points or first principles (archai). The article concludes by returning to dialectic and philosophy and an important difference between them.

Keywords: Aristotle, philosophy, dialectical deduction, dialectic, premises, endoxa, aporiai, scientific starting points, intellectual training, reputable beliefs

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.