| Revue: | Computación y sistemas |
| Base de datos: | PERIÓDICA |
| Número de sistema: | 000394964 |
| ISSN: | 1405-5546 |
| Autores: | Duzi, Marie1 Cihalova, Martina2 |
| Instituciones: | 1VSB-Technical University of Ostrava, Department of Computer Science, Ostrava. República Checa 2Palacky University Olomouc, Department of Philosophy, Olomouc. República Checa |
| Año: | 2015 |
| Periodo: | Oct-Dic |
| Volumen: | 19 |
| Número: | 4 |
| Paginación: | 647-659 |
| País: | México |
| Idioma: | Inglés |
| Tipo de documento: | Artículo |
| Enfoque: | Analítico |
| Resumen en inglés | The paper deals with empirical questions that come attached with a presupposition. In case that the presupposition is not true, there is no unambiguous direct answer. In such a case an adequate complete answer is a negated presupposition. Yet these simple ideas are connected with a bunch of problems. First, we must distinguish between a pragmatic and semantic presupposition, and thus also between a presupposition and mere entailment. Second, we show that the common definition of a presupposition of a question as such a proposition that is entailed by every possible answer to the question is not precise. We follow Frege and Strawson in treating survival under negation as the most important test for presupposition. But a negative answer to a question is often ambiguous. The ambiguity consists in not distinguishing between two kinds of negative answers, to wit the answers applying narrow-scope or wide-scope negation. While the former preserves presupposition, the latter seems to be presupposition denying. We show that in order the negative answer to be unambiguous, instead of the wide-scope negation presumably denying presupposition, an adequate and unambiguous answer is just the negated presupposition. Having defined presupposition of a question more precisely, we then examine Yes-No questions, Wh-questions, and exclusive-or questions with respect to several kinds of presupposition triggers. These include inter alia topic-focus articulation, verbs expressing termination of an activity, factive verbs, the "whys and how comes", and past or future tense with reference time interval. Our background theory is Transparent Intensional Logic (TIL) with its procedural semantics. TIL is an expressive logic apt for analysis of questions and presuppositions, because within TIL we work with partial functions, in particular, with propositions with truth-value gaps. These features enabled us to define a general analytic schema of se |
| Disciplinas: | Ciencias de la computación, Filosofía, Literatura y lingüística |
| Palabras clave: | Inteligencia artificial, Procesamiento de datos, Lógica, Semántica y semiótica, Sistemas multiagente, Semántica, Preguntas, Pragmatismo, Presuposiciones |
| Keyword: | Computer science, Philosophy, Literature and linguistics, Artificial intelligence, Data processing, Logic, Semantics and semiotics, Multi-agent systems, Semantics, Questions, Pragmatics, Presuppositions |
| Texte intégral: | Texto completo (Ver PDF) |
