前提의 承繼條件에 관하여 = On Inheritance Condition for Presuppositions

다국어 초록 (Multilingual Abstract)

The main purpose of this paper is to investigate the projection problem for presuppositions in compound sentences involving connectives that Karttunen originally characterized as filters (and, or, if ~ then). Many linguists suggested how the presuppositions of constituents of compound sentences contribute to the presuppositions of utterances of those sentences.
1. T. Langendoen and H. Savin proposed Cumulative Hypothesis as it solution.
This hypothesis is composed of two claims:
Claim 1 : Compound(multiclause) sentences inherit all of the presuppositions of their constituent clauses.
Claim 2: If a sentence S presupposes P, then assertive utterances of S also presuppose P.
The two claims account for a variety of cases, but they incorrectly predict that the sentences which contain logical connectives inherit the presuppositions of their constituents.
2. L Karttunen and S. Peters proposed "Noncumulative algorithms and Uncancelable, sentential presuppositions" hypotheses as its solution. Using these inheritance conditions, they could generate the right presuppositions directly. However, their inheritance algorithms for presuppositions have weakness-namely, not allowing conversational implicatures to play any important part in the cancellation of presuppositions. Since Karttunen-Peters's inheritance conditions are stated in terms of uncancelable, sentential presuppositions, cancellation by conversational implicature is impossible.
3. G. Gazdar and S. Soames proposed "Cumulative projection algorithm and Cancelable potential presuppositions" hypotheses, which can be canceled by conversational and contextual means. Since this algorithm makes presuppositions conversationally by a theory of conversational implicature. According to their strategy, however, a potential presupposition P of constituent becomes an actual presupposition of an utterance, unless the contextual and conversational implicatures of the utterance entail that the speaker is not taking P for granted. Thus, it is impossible for an utterance to be noncommittal with respect to potential presupposition P.
4. S. Soames suggested a synthesis hypothesis, that is, "Gazdar-Soames's cancelable potential presuppositions and Karttunen and Peter's noncumulative algorithms." Proposed solution to projection problem is as follows:
a. Characterization of constructions that give to potential presuppositions
b. Definition of remaining potential presuppositions of S relative to U
c. Definition of actual presuppositions of S relative to U
d. Predictive principle

목차 (Table of Contents)

• Ⅰ. 序 論
• Ⅱ. Langendoen-Savin의 累加的 假說
• Ⅲ. Karttunen-Peters의 假說
• 1. 常例的 含蓄
• 2. 상례적 함축의 문제점
• Ⅳ. Gazdar-Soames의 假說
• 1. 可能前提
• 2. 가능전제의 문제점
• Ⅴ. 統合假說
• Ⅵ. 結 論