Paper Info
Title
Smooth Yet Discrete: Modeling Both Non-transitivity and the Smoothness of Graded Categories With Discrete Classification Rules
Abstract
Many of our categorization experiences are non-transitive. For some objects a, b and c, a and b can appear indistinguishable, and likewise b and c, but a and c can appear distinguishable. Many categories also appear to be smooth; transitions between cases are not experienced as sharp, but rather as continuous. These two features of our categorization experiences tend to be addressed separately. Moreover, many views model smoothness by making use of infinite degrees. This paper presents a methodological strategy that shows how solving the transitivity problem first can thereby introduce explanatory resources that feed into an account of smoothness without having to make use of infinite degrees.
Year
DOI
Venue
2014
10.1007/s11023-013-9328-0
Minds and Machines
Keywords
Field
DocType
Categorization,Transitivity,Membership degrees,Continuity,Indistinguishability,Vagueness,Classification rules
Categorization,Discrete mathematics,Vagueness,Algebra,Discrete Modeling,Computer science,Artificial intelligence,Smoothness,Transitive relation
Journal
Volume
Issue
ISSN
24
3
0924-6495
Citations 
PageRank 
References 
0
0.34
2
Authors
1
Name
Order
Citations
PageRank
Bert Baumgaertner141.53