Self-defeating arguments

Minds and Machines 1 (4):367-392 (1991)
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.
Keywords Argument  defeasible  nonmonotonic
Categories (categorize this paper)
DOI 10.1007/BF00352916
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history Request removal from index
Download options
PhilPapers Archive

Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 24,433
External links
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library
References found in this work BETA
John Pollock (1987). Defeasible Reasoning. Cognitive Science 11 (4):481-518.

View all 8 references / Add more references

Citations of this work BETA
John L. Pollock (1992). Rationality, Function, and Content. Philosophical Studies 65 (1-2):129-151.
John L. Pollock (2012). Oscar. Journal of Applied Non-Classical Logics 6 (1):89-113.

View all 6 citations / Add more citations

Similar books and articles

Monthly downloads

Added to index


Total downloads

72 ( #67,656 of 1,925,045 )

Recent downloads (6 months)

4 ( #212,110 of 1,925,045 )

How can I increase my downloads?

My notes
Sign in to use this feature

Start a new thread
There  are no threads in this forum
Nothing in this forum yet.