Notice bibliographique
Résumé
Reviews 77 THE DENOTING READER NICHOLAS GRIFFIN Russell Research Centre / McMaster U. Hamilton, ON, Canada L8s 4M2 NGRIFFIN@MCMASTER.CA Gary Ostertag, ed. Definite Descriptions: a Reader. Cambridge, Mass., and London: MIT P., 1998. Pp. xii, 411. US$32.95 (cloth); US$30.00 (pb). Russell's theory of definite descriptions has been widely and continuously debated in the half century since Strawson published "On Referring".I Given the number of important papers written on the topic in that timenot to mention the even larger number of unimportant ones-it is more than a little surprising that there has been, until Ostertag's book, no substantial collection of readings on the topic. Ostertag's Definite Descriptions fills this gap admirably-though, as he admits at the outset, many important papers and some important topics have been left out. Among the latter he mentions descriptive pronouns (p. xi); I shall mention some others below. The papers can be divided into two main groups: four selections in which Russell's original theory is expounded and a group of eight papers taking sides on various current controversies over the adequacy of Russell's theory. In between are three more miscellaneous papers: Strawson's "On Referring", which couldn't well be omitted and, in any case, set several of the current controversies going; an extract from Carnap's Meaning and Necessity giving a version of Frege's conventional denotation proposal; and Karel Lambert's "A I Mind (1950); reprinted here as Chap. 6. 78 Reviews Theory of Definite Descriptions", which represents free logic.2 Lambert's paper is a decent introduction to free logic, but it was written too early to capture the important link between Strawson's paper and free logic which emerged with the development of supervaluational semantics for free logic. Sadly, there is nothing on Meinongian theories of descriptions, which have had a substantial revival since the 19705. Nor is there anything on more purely linguistic work on definite descriptions. Rereading Strawson's paper after all theseyears, one is struck first by how beautifully written it is. One is also struck by the fact that although it pointed to all sorts of fruitful developments, it does hardly anything to bring them about. An amusing case in point is the "very special and odd sense of 'imply'" (p. 145) in which, Strawson wants to say, "The king of France is wise" implies that there is a king of France. Strawson repeatedly invokes this sense and toward the end of his paper even refers to the sense as "by now familiar" (p. 157). But repeatedly calling something "strange" does not make it familiar, and Strawson says not one thing about it-except that it does not mean either "entail" or "assert". It is, of course, the useful notion of presupposition , given formal articulation by van Fraassen,3 against every warning by Strawson who maintained that "ordinary language has no exact logic" (p. 159). Here, and elsewhere, Strawson's paper proved seminal in spite of his best efforts. The four expository selections include three by Russell: "On Denoting" (of course), the much more accessible chapter on descriptions from Introduction to Mathematical Philosophy,4 .and the relevant sections of Principia Mathematica (pp. 30-2 and 66-71 from the Introduction, and the Summary of *14). These are well-nigh essential, but the dotty notation of Principia does pose problems for using the text in the classroom. Perhaps because I had assumed that the students would get the hang of it relatively quickly, I found myself continually obliged to stop and translate into a notation that used more brackets and fewer dots. Fortunately, Ostertag himself gives a lucid summary in more modern notation in his Introduction.5 The fourth paper in 1 From his Philosophical Applications of Free Logic (Dordrecht: Kluwer, 1962; New York: Oxford U. P., 1991)-wrongly cited in the bibliography as "Philosophical Foundations of Free Logic". 3 Cf "Presuppositions, Supervaluations, and Free Logic", in K. Lambert, ed., The Logical ~y of Doing Things (New Haven, Conn.: Yale U. P., 1969); and Formal Semantics and Logic (London: Macmillan, 1971), pp. 153-63. 4 Reprinted complete with typos: "a propositional fUnction x' (towards the foot...
Récupéré en direct depuis OpenAlex et désinversé. Les résumés ne sont pas conservés dans cette base de données : les index inversés représentent 8,6 Go des 9,3 Go de texte de la base, et le serveur dispose de 13 Go libres.
Comment cette classification a été obtenuedéplier
Prédiction distillée sur la base complète
Imitation des enseignantsNi prévalence calibrée, ni vérité terrain. Validation humaine à venir. Apprise à partir de 10 348 étiquettes directes de Codex et de 10 348 étiquettes directes de Gemma. Le mode candidate est l'union des têtes enseignantes seuillées; le consensus est leur intersection. Ces sorties portent le statut machine_predicted_unvalidated et ne sont ni des étiquettes humaines ni des étiquettes directes de modèles de pointe.
Scores Codex et Gemma par catégorie
| Catégorie | Codex | Gemma |
|---|---|---|
| Métarecherche | 0,003 | 0,000 |
| Méta-épidémiologie (sens strict) | 0,000 | 0,000 |
| Méta-épidémiologie (sens large) | 0,000 | 0,000 |
| Bibliométrie | 0,000 | 0,000 |
| Études des sciences et des technologies | 0,001 | 0,001 |
| Communication savante | 0,000 | 0,000 |
| Science ouverte | 0,001 | 0,000 |
| Intégrité de la recherche | 0,000 | 0,000 |
| Charge utile insuffisante (le modèle a refusé de juger) | 0,001 | 0,000 |
Scores machine (provisoires)
Les deux têtes enseignantes du modèle étudiant, lues sur ce travail. Un score ordonne la base pour la relecture; il n'affirme jamais une catégorie, et le statut de validation accompagne chaque rangée tel quel.
Scores de référence d'un modèle non mature (critères de maturité non atteints, 7 itérations). Un score ordonne; il n'affirme jamais une catégorie.
score_only:v0-immature-baseline · tel quel depuis la passe de notation : score_only signifie que le nombre peut ordonner les travaux, et qu'aucune étiquette de catégorie n'en découleClassification
machine, non validéePrédiction automatique; un appel candidat d’une seule tête enseignante, pas un consensus.
Le détail, modèle par modèle et score par score, se trouve en fin de page sous « Comment cette classification a été obtenue ».