Self-defeating arguments

Minds and Machines 1 (4):367-392 (1991)
  Copy   BIBTEX


An argument is self-defeating when it contains defeaters for some of its own defeasible lines. It is shown that the obvious rules for defeat among arguments do not handle self-defeating arguments correctly. It turns out that they constitute a pervasive phenomenon that threatens to cripple defeasible reasoning, leading to almost all defeasible reasoning being defeated by unexpected interactions with self-defeating arguments. This leads to some important changes in the general theory of defeasible reasoning.



    Upload a copy of this work     Papers currently archived: 92,931

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library


Added to PP

152 (#127,505)

6 months
15 (#185,076)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

John Pollock
University of Edinburgh

Citations of this work

Abstract argumentation systems.Gerard A. W. Vreeswijk - 1997 - Artificial Intelligence 90 (1-2):225-279.
How to reason defeasibly.John L. Pollock - 1992 - Artificial Intelligence 57 (1):1-42.
Justification and defeat.John L. Pollock - 1994 - Artificial Intelligence 67 (2):377-407.

View all 20 citations / Add more citations

References found in this work

Probability and the logic of rational belief.Henry Ely Kyburg - 1961 - Middletown, Conn.,: Wesleyan University Press.
Knowledge and Justification.John L. Pollock - 1974 - Princeton, N.J.: Princeton University Press. Edited by John Pollock.
Defeasible Reasoning.John L. Pollock - 1987 - Cognitive Science 11 (4):481-518.
The paradox of the preface.David C. Makinson - 1965 - Analysis 25 (6):205-207.

View all 11 references / Add more references