This dissertation formulates, defends, and exemplifies a semantic approach that I call Cognitive Decompositionism. Cognitive Decompositionism is one version of lexical decompositionism, which holds that the meaning of lexical items are decomposable into component parts. Decompositionism comes in different varieties that can be characterized in terms of four binary parameters. First, Natural Decompositionism contrasts with Artful Decompositionism. The former views components as word-like, the latter views components more abstractly. Second, Convenient Decompositionism claims that components are merely convenient fictions, while Real Decompositionism claims that components are psychologically real. Third, Truth-conditional Decompositionism contrasts with various non-truth-conditional theories, in particular with Quantum Semantics. And fourth, Holistic Decompositionism assumes that decompositions are circular, as opposed to Atomistic Decompositionism, which assumes that some primitive basis ultimately underlies semantic components. Cognitive Decompositionism is the conjunction of the following theses: decomposition is Artful (chapter 2), Psychologically Real (chapter 3), Quantum (chapter 4), and Atomistic (chapter 5). As I substantiate these claims, I will be responding to the anti-decompositionist theories of Fodor, Davidson, and Quine.
Identifer | oai:union.ndltd.org:arizona.edu/oai:arizona.openrepository.com:10150/185592 |
Date | January 1991 |
Creators | Saka, Paul. |
Contributors | Lehrer, Adrienne, Langendoen, Terry, Cummins, Rob |
Publisher | The University of Arizona. |
Source Sets | University of Arizona |
Language | English |
Detected Language | English |
Type | text, Dissertation-Reproduction (electronic) |
Rights | Copyright © is held by the author. Digital access to this material is made possible by the University Libraries, University of Arizona. Further transmission, reproduction or presentation (such as public display or performance) of protected items is prohibited except with permission of the author. |
Page generated in 0.0018 seconds