Defeasible Classifications and Inferences from Definitions.

Informal Logic 30 (1):34-61 (2010)
Download Edit this record How to cite View on PhilPapers
Abstract
We contend that it is possible to argue reasonably for and against arguments from classifications and definitions, provided they are seen as defeasible (subject to exceptions and critical questioning). Arguments from classification of the most common sorts are shown to be based on defeasible reasoning of various kinds represented by patterns of logical reasoning called defeasible argumentation schemes. We show how such schemes can be identified with heuristics, or short-cut solutions to a problem. We examine a variety of arguments of this sort, including argument from abductive classification, argument from causal classification, argument from analogy-based classification and arguments from classification based on generalizations
PhilPapers/Archive ID
MACDCA-3
Upload history
Archival date: 2011-01-24
View other versions
Added to PP index
2011-01-24

Total views
388 ( #15,709 of 2,439,597 )

Recent downloads (6 months)
54 ( #12,538 of 2,439,597 )

How can I increase my downloads?

Downloads since first upload
This graph includes both downloads from PhilArchive and clicks on external links on PhilPapers.